The Erdős–Ko–Rado theorem provides a fundamental upper bound on the number of intersecting sets within a family, a core result that anchors the career of Richard Rado. Spanning decades of investigation into combinatorics and graph theory, his technical output established frameworks for partition theory, matroid theory, and the structural properties of infinite graphs.
Academic Foundation
Born in Berlin in 1906, Rado completed his initial education at the Frederick William University in Berlin. He later moved to the University of Cambridge, attending Fitzwilliam College between 1933 and 1935. This period resulted in the completion of two doctoral degrees, providing the rigorous basis for his subsequent research into systems of linear equations and set theory.
Twenty questions, eight minutes on the clock, and a percentile measured against everyone who has taken it. No sign-up.
Take the IQ test →Professional Appointments
Rado held multiple teaching and research positions across several institutions. His career included tenures at the University of Sheffield from 1936 to 1947, followed by an appointment at King's College London from 1947 to 1954. He subsequently moved to the University of Reading, serving there until his retirement in 1971. In 1971 and 1972, he worked at the University of Waterloo.
Contributions to Combinatorics
Much of his work focused on graph theory and combinatorial set theory, often in collaboration with Paul Erdős. Notable results include the Erdős–Rado theorem, which extended Ramsey's theorem to infinite sets, and the Milner–Rado paradox concerning partitions of ordinals. In 1964, he rediscovered the Rado graph, a countably infinite structure containing all other countably infinite graphs as induced subgraphs. His work in matroid theory yielded Rado's transversal theorem, which generalized the Marriage Theorem for matchings involving matroid structures.
Recognition
Professional recognition for his contributions arrived through prestigious fellowships and awards. He was elected a Fellow of the Royal Society in 1978. In 1972, he received the Senior Berwick Prize. Rado died in 1989 in Henley-on-Thames.
Fast facts
- Born: 1906, Berlin
- Died: 1989, Henley-on-Thames
- Primary field: Combinatorics
- Notable work: Rado graph
- Education: Frederick William University Berlin; University of Cambridge
- Award: Senior Berwick Prize (1972)
- Professional membership: Fellow of the Royal Society
Questions readers ask
What is the Rado graph?
It is a countably infinite graph that contains all other countably infinite graphs as induced subgraphs.
In which mathematical sub-fields did Rado work?
His research was concentrated primarily in combinatorics, graph theory, and combinatorial set theory.
Achievements
- Notable work: Rado's theorem
- Notable work: Rado's transversal theorem
- Notable work: Erdős–Rado theorem
- Notable work: Erdős–Ko–Rado theorem
- Affiliated with King's College London, University of Sheffield and University of Reading
- Educated at University of Cambridge, Frederick William University Berlin and Fitzwilliam College
- Worked as mathematician and university teacher
