A survey of hypergraph Ramsey problems

DOI10.1007/978-3-030-55857-4_16MaRDI QIDQ2232043zbMATH OpenOpenAlexFDO

Authors Dhruv Mubayi, Andrew Suk

Publication date 4 October 2021

Full work available at URL https://arxiv.org/abs/1707.04229

zbMATH Keywords

hypergraph Ramsey numberoff-diagonal Ramsey numbers

Mathematics Subject Classification ID

Generalized Ramsey theory (05C55) Hypergraphs (05C65) Ramsey theory (05D10)

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.

Recommendations

• Hypergraph Ramsey numbers
• Recent developments in graph Ramsey theory
• Off-diagonal hypergraph Ramsey numbers
• Lower bounds for hypergraph Ramsey numbers
• New lower bounds for hypergraph Ramsey numbers

Cited in

(13)

• On the size-Ramsey number of hypergraphs
• Multicolor Ramsey numbers for Berge cycles
• The growth rate of multicolor Ramsey numbers of 3-graphs
• Ramsey numbers of semi-algebraic and semi-linear hypergraphs
• Two problems in graph Ramsey theory
• Constrained Ramsey numbers for the loose path, cycle and star
• Recent developments in graph Ramsey theory
• Large sets of \(t\)-designs and a Ramsey-type problem
• A class of Ramsey-extremal hypergraphs
• Ramsey numbers of Boolean lattices
• Growth rates of the bipartite Erdős-Gyárfás function
• Longest paths in random hypergraphs
• A note on the Erdős-Hajnal hypergraph Ramsey problem

This page was built for publication: A survey of hypergraph Ramsey problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2232043)