Exponential upper-bound conjecture for the three-uniform color-avoiding Ramsey function
Let be the least integer such that every three-coloring of the edges of the complete three-uniform hypergraph contains a copy of using at most two colors. Exponential upper-bound conjecture. There exists a constant such that
The corresponding color-avoiding problem is open, and even in uniformity three the quantitative behavior for and is poorly understood. Existing methods give an exponential-type lower bound and a double-exponential upper bound, so the conjecture would substantially improve the known upper bound and determine the tower height.
References
- Eion Mulrenin, Cosmin Pohoata and Dmitrii Zakharov, “Color avoidance for monotone paths”, arXiv:2411.19823 (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.