← All problems

The St. Ives matching conjecture for online path Ramsey numbers

4 years old · traced to

For each k≥1k\geq 1, let SkS_k be the St. Ives ordered matching defined recursively from two disjoint consecutive copies of Sk−1S_{k-1} by adding an edge whose endpoints lie respectively to the left and right of both copies. Let ro(Sk,Pn)r_o(S_k,P_n) denote the online Ramsey number for finding an ordered copy of SkS_k or an ordered path PnP_n.

St. Ives matching conjecture. For all k≥1k\geq 1, there is a constant ckc_k such that for all n≥1n\geq 1,

ro(Sk,Pn)≤n+ck.r_o(S_k,P_n)\leq n+c_k.

Every intersection-free matching on kk edges is a subgraph of SkS_k, so this statement is equivalent to the intersection-free matching conjecture. The source gives no resolution of the conjecture.

References
  1. Felix Christian Clemen, Emily Heath and Mikhail Lavrov, “Online Ramsey numbers of ordered paths and cycles”, arXiv:2210.05235 (2024).

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.