Erdős–Hajnal tower-growth conjecture for
Erdős–Hajnal tower-growth conjecture for
For integers and , let be the Erdős–Hajnal Ramsey parameter. Define and . Erdős–Hajnal conjecture. There is a constant such that
The source gives the matching tower-level upper bound and conjectures that this is the correct tower growth rate. The cases and partial bounds for are known, but the general lower bound remains open.
Sources & referencesView supporting material
Primary source
Dhruv Mubayi and Andrew Suk, “A survey of hypergraph Ramsey problems”, arXiv:1707.04229 (2018).
Progress summary
Never refreshed
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.