Mubayi–Stein strengthening for tight-path Ramsey numbers

At least 8 years old · documented by

For fixed k≥4k\geq4, let Pk+1P_{k+1} denote the relevant kk-uniform tight path, and let r‾k(Pk+1,n)\overline r_k(P_{k+1},n) be its Ramsey number against a complete kk-uniform hypergraph on nn vertices. Define twr⁡1(x)=x\operatorname{twr}_1(x)=x and twr⁡i+1(x)=2twr⁡i(x)\operatorname{twr}_{i+1}(x)=2^{\operatorname{twr}_i(x)}. Mubayi–Stein conjecture.

r‾k(Pk+1,n)≥twr⁡k−1(Ω(n)).\overline r_k(P_{k+1},n)\geq\operatorname{twr}_{k-1}(\Omega(n)).

This strengthens the Erdős–Hajnal prediction and would improve the known lower bound by one tower level. The source relates the case k=4k=4 to the diagonal 3-uniform Ramsey conjecture.

References

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

No solutions have been posted yet.