Cyclic Ramsey conjecture for complete graphs and alternating paths
Let be a complete graph of order and an alternating path of order . Complete-graph cyclic conjecture. For any , we have
The claim is suggested by the computational data and contrasts with the proposed larger ordered Ramsey numbers. The cyclic equality remains open.
References
- 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
No solutions have been posted yet.