A survey of hypergraph Ramsey problems
Preprint
Abstract
The classical hypergraph Ramsey number $r_k(s,n)$ is the minimum $N$ such that for every red-blue coloring of the $k$-tuples of $\{1,\ldots, N\}$, there are $s$ integers such that every $k$-tuple among them is red, or $n$ integers such that every $k$-tuple among them is blue. We survey a variety of problems and results in hypergraph Ramsey theory that have grown out of understanding the quantitative aspects of $r_k(s,n)$. Our focus is on recent developments and open problems.
Keywords
All Related Versions
This publication has 59 references indexed in Scilit:
- Dynamic concentration of the triangle‐free processRandom Structures & Algorithms, 2020
- The Ramsey number of loose cycles versus cliquesJournal of Graph Theory, 2018
- Coloring Triple Systems with Local ConditionsJournal of Graph Theory, 2015
- The poset of hypergraph quasirandomnessRandom Structures & Algorithms, 2013
- On Generalized Ramsey Numbers for 3‐Uniform HypergraphsJournal of Graph Theory, 2013
- Coloring H‐free hypergraphsRandom Structures & Algorithms, 2009
- On a Problem of Formal Logic2009
- Ramsey numbers of sparse hypergraphsRandom Structures & Algorithms, 2008
- Open problems of Paul Erd s in graph theoryJournal of Graph Theory, 1997
- Note on independent sets in steiner systemsRandom Structures & Algorithms, 1994