The polynomial-exponent conjecture for ordered Ramsey numbers of path powers
Let be the th power of the ordered path on vertices, and let be the ordered complete graph on vertices. Write for the ordered Ramsey number. Polynomial-exponent conjecture. The bound
should hold.
References
Status
- Solved: Lior Gishboliner, Zhihan Jin, and Benny Sudakov. Ramsey Problems for Monotone Paths in Graphs and Hypergraphs (Combinatorica, 2024) https://link.springer.com/article/10.1007/s00493-024-00082-7
Source: Lior Gishboliner, Zhihan Jin and Benny Sudakov, “Ramsey problems for monotone paths in graphs and hypergraphs”, arXiv:2308.04357 (2023).
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.