Ordered Ramsey conjecture for complete graphs and alternating paths

Let KaK_a be a complete graph of order aa and PbaltP_b^\mathrm{alt} an alternating path of order bb. Complete-graph–alternating-path conjecture. For any a2a \ge 2 and b3b \ge 3, we have

Rord(Ka,Pbalt)=3ab5a22b+5.R_\mathrm{ord}(K_a, P_b^\mathrm{alt}) = \left\lceil \frac{3ab - 5a}{2} \right\rceil - 2b + 5.

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

No solutions have been posted yet.