Kostochka–Mubayi–Verstraëte loose 5-cycle Ramsey conjecture

For each k3k\geq3, let LC5(k)LC_5^{(k)} be the kk-uniform loose 5-cycle, and let rk(LC5,n)r_k(LC_5,n) denote its Ramsey number against a complete kk-uniform hypergraph on nn vertices. Kostochka–Mubayi–Verstraëte conjecture. There is a constant c=ck>0c=c_k>0 such that

rk(LC5,n)<cn5/4.r_k(LC_5,n)<c n^{5/4}.

The source records a lower bound of order (n/logn)5/4(n/\log n)^{5/4} and presents this as the conjectured matching polynomial upper bound. The correct order 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

No solutions have been posted yet.