The family-level tower lower-bound conjecture for tightly connected hypergraphs
For integers and , let be the family of -tightly connected -graphs that are not -partite. A hypergraph is -tightly connected if any two edges can be joined by a sequence of edges in which consecutive edges share at least vertices. Define the tower function by
The family-level tower lower-bound conjecture. If , then there exists a positive constant such that
This is explicitly proposed as a stronger version of the corresponding conjecture for each individual tightly connected hypergraph. It 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
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.