Rado's Theorem
Rado's Theorem is a foundational result in Ramsey theory that characterizes the partition regularity of systems of linear equations over the integers by providing necessary and sufficient conditions under which such systems admit monochromatic solutions under any finite coloring.
84
Publications
4.1K
Citations
121
Authors
96
Institutions
Publications per year
2017–2026
10
Variants
Rado Theorem
Parents
84
The exact bound in the Erdös-Ko-Rado theorem
Richard M. Wilson · COMBINATORICA · 1984 · 255 citations
A THEOREM ON INDEPENDENCE RELATIONS
R. Rado · The Quarterly Journal of Mathematics · 1942 · 191 citations
The Erdös-Ko-Rado theorem for vector spaces
Péter Frankl, R. Wilson · Journal of Combinatorial Theory Series A · 1986 · 163 citations
1–5 of 84
121
7
h-index
7
h-index
3
h-index
2
h-index
2
h-index
1–5 of 121
96
California Institute of Technology
Pasadena, United States
4 h-index
4 publications
887 citations

University of Regina
Regina, Canada
4 h-index
7 publications
126 citations
The Ohio State University
Columbus, United States
3 h-index
4 publications
62 citations

Centre National de la Recherche Scientifique
Paris, France
3 h-index
3 publications
230 citations
Massachusetts Institute of Technology
Cambridge, United States
2 h-index
4 publications
140 citations
University of Oxford
Oxford, United Kingdom
2 h-index
4 publications
58 citations

University of Calgary
Calgary, Canada
2 h-index
2 publications
68 citations
University of Vienna
Vienna, Austria
2 h-index
2 publications
24 citations
1–8 of 96
11 publications · 584 citations
10
h-index
TRAN · 6 publications · 788 citations
6
h-index
6 publications · 467 citations
6
h-index
5 publications · 103 citations
5
h-index
Repository · 4 publications · 124 citations
4
h-index
1–5