Hypergraph Ramsey Numbers
Hypergraph Ramsey Numbers is a numerical invariant in combinatorics that denotes the smallest integer \( n \) such that any 2-coloring of the edges of a complete \( k \)-uniform hypergraph on \( n \) vertices contains a monochromatic complete subhypergraph on a specified number of vertices.
40
Publications
1.4K
Citations
68
Authors
53
Institutions
Publications per year
2017–2026
8
Parents
40
Stanisław Radziszowski · The Electronic Journal of Combinatorics · 2011 · 430 citations · Full text
The Ramsey number for hypergraph cycles I
Penny Haxell, Tomasz Łuczak, Yuejian Peng et al. · Journal of Combinatorial Theory Series A · 2005 · 62 citations
Embeddings and Ramsey numbers of sparse κ-uniform hypergraphs
Oliver Cooley, Nikolaos Fountoulakis, Daniela Kühn et al. · COMBINATORICA · 2009 · 56 citations
Anti-Ramsey number of matchings in hypergraphs
Lale Özkahya, Michael E. Young · Discrete Mathematics · 2013 · 46 citations · Full text
1–5 of 40
68
4
h-index
4
h-index
4
h-index
3
h-index
3
h-index
1–5 of 68
53
Emory University
Atlanta, United States
5 h-index
7 publications
217 citations
University of Illinois Urbana-Champaign
Urbana, United States
4 h-index
5 publications
155 citations

Hungarian Academy of Sciences
Budapest, Hungary
3 h-index
5 publications
150 citations

Adam Mickiewicz University in Poznań
Poznan, Poland
3 h-index
5 publications
202 citations
University of Illinois Chicago
Chicago, United States
3 h-index
3 publications
53 citations
Western Michigan University
Kalamazoo, United States
2 h-index
2 publications
28 citations

Zhejiang Normal University
Jinhua, China
2 h-index
2 publications
42 citations
University of California San Diego
San Diego, United States
2 h-index
2 publications
44 citations
1–8 of 53
4 publications · 523 citations
4
h-index
4 publications · 108 citations
4
h-index
4 publications · 151 citations
4
h-index
4 publications · 59 citations
4
h-index
3 publications · 111 citations
3
h-index
1–5