Ordered Ramsey conjecture for complete graphs and alternating paths
Ordered Ramsey conjecture for complete graphs and alternating paths
Let be a complete graph of order and an alternating path of order . Complete-graph–alternating-path conjecture. For any and , we have
The formula is inferred from the computational comparison of ordered Ramsey numbers for complete graphs and alternating paths. The general ordered result remains open.
Sources & referencesView supporting material
Primary source
Nino Bašić, Ivan Damnjanović, Dragan Stevanović and Ivan Stošić, “Some results on small ordered and cyclic Ramsey numbers”, arXiv:2604.16188 (2026).
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
Sign in to submit a solution.
No solutions have been posted yet.