Ramsey Multiplicity is a quantitative measure in extremal combinatorics that denotes the minimum number of monochromatic complete subgraphs of a given order guaranteed to exist in any edge coloring of a sufficiently large complete graph.
85
Publications
2.5K
Citations
126
Authors
99
Institutions
Publications per year
2017–2026
11
Parents
Publications
85
The Ramsey number of a graph with bounded maximum degree
C Chvatál, V. Rödl, Endre Szemerédi et al. · Journal of Combinatorial Theory Series B · 1983 · 185 citations
Sharp Bounds For Some Multicolor Ramsey Numbers
Vojtěch Rödl · COMBINATORICA · 2005 · 67 citations
1–5 of 85
Authors
126
- RH
7
h-index
- RJ
5
h-index
- SB
4
h-index
- YL
4
h-index
- VR
4
h-index
1–5 of 126
Institutions
99
University of Memphis
Memphis, United States
7 h-index
13 publications
660 citations
Emory University
Atlanta, United States
6 h-index
7 publications
246 citations
Charles University
Prague, Czechia
4 h-index
13 publications
182 citations
Adam Mickiewicz University in Poznań
Poznan, Poland
4 h-index
6 publications
116 citations
City College of New York
New York, United States
4 h-index
4 publications
116 citations
Hungarian Academy of Sciences
Budapest, Hungary
4 h-index
6 publications
391 citations
Nanjing University
Nanjing, China
4 h-index
7 publications
92 citations
University of Illinois Urbana-Champaign
Urbana, United States
3 h-index
3 publications
84 citations
1–8 of 99
Venues
- Discrete Mathematics
14 publications · 327 citations
12
h-index
- Graphs and Combinatorics
11 publications · 247 citations
11
h-index
- Journal of Combinatorial Theory Series B
11 publications · 614 citations
10
h-index
- Journal of Graph Theory
8 publications · 227 citations
8
h-index
- COMBINATORICA
5 publications · 219 citations
5
h-index
1–5