Kostochka–Mubayi–Verstraëte loose 5-cycle Ramsey conjecture
For each , let be the -uniform loose 5-cycle, and let denote its Ramsey number against a complete -uniform hypergraph on vertices. Kostochka–Mubayi–Verstraëte conjecture. There is a constant such that
The source records a lower bound of order and presents this as the conjectured matching polynomial upper bound. The correct order remains open.
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.