Ramsey's Theorem
Ramsey's Theorem is a foundational result in combinatorics that asserts that in any sufficiently large complete structure—such as a graph or set system—partitioned into finitely many classes, there necessarily exists a large complete substructure, all of whose elements belong to the same class.
656
Publications
26.8K
Citations
658
Authors
366
Institutions
Publications per year
2017–2026
71
Parents
656
Paul Erdős · Canadian Journal of Mathematics · 1959 · 602 citations · Full text
A partition calculus in set theory
Péter L. Erdős, R. Rado · Bulletin of the American Mathematical Society · 1956 · 439 citations · Full text
Stanisław Radziszowski · The Electronic Journal of Combinatorics · 2011 · 430 citations · Full text
Peter Diamond · Journal of Public Economics · 1975 · 420 citations
Miklós Ajtai, János Komlós, Endre Szemerédi · Journal of Combinatorial Theory Series A · 1980 · 371 citations
1–5 of 656
658
19
h-index
18
h-index
16
h-index
15
h-index
15
h-index
1–5 of 658
366

Hungarian Academy of Sciences
Budapest, Hungary
20 h-index
52 publications
2.1K citations
University of Illinois Urbana-Champaign
Urbana, United States
19 h-index
48 publications
1.6K citations
University of Memphis
Memphis, United States
19 h-index
69 publications
2.2K citations
Charles University
Prague, Czechia
17 h-index
46 publications
1.5K citations
Emory University
Atlanta, United States
16 h-index
29 publications
853 citations

Tel Aviv University
Tel Aviv, Israel
15 h-index
26 publications
1.2K citations
City College of New York
New York, United States
13 h-index
15 publications
537 citations
Universidade de São Paulo
São Paulo, Brazil
13 h-index
28 publications
598 citations
1–8 of 366
58 publications · 1.7K citations
23
h-index
51 publications · 1.7K citations
23
h-index
34 publications · 1.7K citations
21
h-index
33 publications · 1.8K citations
20
h-index
29 publications · 1.6K citations
19
h-index
1–5