Ramsey Theory
Ramsey Theory is a branch of combinatorics in discrete mathematics that studies the conditions under which sufficiently large discrete structures, under arbitrary partitions or colorings, necessarily contain substructures exhibiting prescribed patterns or order.
1.4K
Publications
55K
Citations
1.5K
Authors
654
Institutions
Publications per year
2017–2026
138
1.4K
CBMS-NSF REGIONAL CONFERENCE SERIES IN APPLIED MATHEMATICS
David Gottlieb, Steven A. Orszag, Peter J. Huber et al. · 2011 · 984 citations
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
1–5 of 1.4K
1.5K
22
h-index
22
h-index
19
h-index
19
h-index
17
h-index
1–5 of 1.5K
654

Hungarian Academy of Sciences
Budapest, Hungary
30 h-index
92 publications
3.7K citations
University of Memphis
Memphis, United States
26 h-index
96 publications
3.7K citations

Tel Aviv University
Tel Aviv, Israel
24 h-index
46 publications
2.2K citations
University of Illinois Urbana-Champaign
Urbana, United States
22 h-index
64 publications
1.9K citations
University of California, Los Angeles
Los Angeles, United States
20 h-index
32 publications
2.1K citations
Emory University
Atlanta, United States
20 h-index
49 publications
1.4K citations
Charles University
Prague, Czechia
19 h-index
50 publications
1.6K citations
Massachusetts Institute of Technology
Cambridge, United States
19 h-index
37 publications
1.9K citations
1–8 of 654
113 publications · 3.4K citations
31
h-index
81 publications · 2.7K citations
29
h-index
54 publications · 2.4K citations
28
h-index
53 publications · 2.4K citations
25
h-index
40 publications · 1.9K citations
25
h-index
1–5