Richard Rado

From Wikipedia, the free encyclopedia
Jump to: navigation, search
Richard Rado
Richard Rado.jpg
Richard Rado, ca. 1967
Born (1906-04-28)28 April 1906
Died 23 December 1989(1989-12-23) (aged 83)
Nationality British
Fields Mathematics
Alma mater University of Cambridge
University of Berlin
Doctoral advisor G. H. Hardy
Issai Schur
Doctoral students David Daykin
Gabriel Dirac
Kenneth Gravett
Eric Milner
Known for Erdős–Rado theorem
Erdős–Ko–Rado theorem
Milner–Rado paradox
Notable awards Senior Berwick Prize (1972), Fellow of the Royal Society[1]

Richard Rado FRS[1] (28 April 1906 – 23 December 1989) was a German-born British mathematician whose research concerned combinatorics and graph theory. He was Jewish and left Germany to escape Nazi persecution. He earned two Ph.D.s: in 1933 from the University of Berlin, and in 1935 from the University of Cambridge.[2][3][4] He was interviewed in Berlin by Lord Cherwell for a scholarship given by the chemist Sir Robert Mond which provided financial support to study at Cambridge. After he was awarded the scholarship, Rado and his wife left for the UK in 1933. He was appointed Professor of Mathematics at the University of Reading in 1954 and remained there until he retired in 1971.


Rado made contributions in combinatorics and graph theory including 18 papers with Paul Erdős.

In graph theory, the Rado graph, a countably infinite graph containing all countably infinite graphs as induced subgraphs, is named after Rado. He rediscovered it in 1964 after previous works on the same graph by Wilhelm Ackermann, Paul Erdős, and Alfréd Rényi.

In combinatorial set theory, the Erdős–Rado theorem extends Ramsey's theorem to infinite sets. It was published by Erdős and Rado in 1956. Rado's theorem is another Ramsey-theoretic result concerning systems of linear equations, proved by Rado in his thesis. The Milner–Rado paradox, also in set theory, states the existence of a partition of an ordinal into subsets of small order-type; it was published by Rado and E. C. Milner in 1965.

The Erdős–Ko–Rado theorem can be described either in terms of set systems or hypergraphs. It gives an upper bound on the number of sets in a family of finite sets, all the same size, that all intersect each other. Rado published it with Erdős and Chao Ko in 1961, but according to Erdős it was originally formulated in 1938.

Awards and honours[edit]

In 1972, Rado was awarded the Senior Berwick Prize.[5]