Ramsey-type Theorems
Ramsey-Type Theorems is a class of mathematical results in combinatorics that generalize the classical Ramsey Theorem by establishing conditions under which order necessarily emerges in large, disordered structures, specifically guaranteeing the existence of monochromatic substructures under finite partitions.
763
Publications
29K
Citations
781
Authors
433
Institutions
Publications per year
2017–2026
90
Parents
763
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
Miklós Ajtai, János Komlós, Endre Szemerédi · Journal of Combinatorial Theory Series A · 1980 · 371 citations
Combinatorics of open covers I: Ramsey theory
Marion Scheepers · Topology and its Applications · 1996 · 359 citations
1–5 of 763
781
19
h-index
18
h-index
15
h-index
15
h-index
15
h-index
1–5 of 781
433

Hungarian Academy of Sciences
Budapest, Hungary
25 h-index
79 publications
3.3K citations

Tel Aviv University
Tel Aviv, Israel
20 h-index
33 publications
1.6K citations
University of Illinois Urbana-Champaign
Urbana, United States
19 h-index
49 publications
1.6K citations
University of Memphis
Memphis, United States
17 h-index
64 publications
1.4K citations
Emory University
Atlanta, United States
16 h-index
30 publications
761 citations
Charles University
Prague, Czechia
15 h-index
45 publications
1.3K citations
Princeton University
Princeton, United States
15 h-index
16 publications
783 citations

Institute for Advanced Study
Princeton, United States
15 h-index
20 publications
1.3K citations
1–8 of 433
66 publications · 2.2K citations
28
h-index
72 publications · 2.2K citations
26
h-index
39 publications · 2K citations
22
h-index
36 publications · 1.1K citations
22
h-index
37 publications · 1.4K citations
21
h-index
1–5