The tower lower-bound conjecture for tightly connected hypergraph Ramsey numbers
For integers and , a -graph is a -uniform hypergraph. It is -tightly connected if any two edges and are joined by a sequence of edges such that consecutive edges share at least vertices. A -graph is -partite if its vertices can be partitioned into parts so that every edge has one vertex in each part. Define the tower function by
The tower lower-bound conjecture. If and is an -tightly connected -graph that is not -partite, then there exists a positive constant such that
This would extend the known exponential lower bound for 2-tightly connected non--partite hypergraphs to higher levels of the tower. The conjecture is presented as likely difficult, and remains open.
References
- David Conlon, Jacob Fox, Benjamin Gunby, Xiaoyu He, Dhruv Mubayi, Andrew Suk, Jacques Verstraëte and Hung-Hsun Hans Yu, “When are off-diagonal hypergraph Ramsey numbers polynomial?”, arXiv:2411.13812 (2025).
Progress summary
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.