The pivot-layer colouring conjecture for diagonal poset Ramsey numbers

Let QnQ_n denote the diagonal poset on nn elements, and let R(Qn,Qn)R(Q_n,Q_n) be its two-colour Ramsey number. For a positive integer LL, consider the colouring construction in which 2L2L pairs of layers are modified by 22 families of pivots. Pivot-layer colouring conjecture. For every ϵ>0\epsilon>0, there exist LL and a constant aa such that this type of colouring gives

R(Qn,Qn)(3ϵ)n+a.R(Q_n,Q_n)\geq(3-\epsilon)n+a.

The conjecture asserts that optimizing this family of colourings can asymptotically approach a coefficient of 33, improving on the bounds established in the paper; whether the required choices of layer parameters exist remains open.

Sources & referencesView supporting material

Primary source

Maria-Romina Ivan and Bernardus A. Wessels, “A New Lower Bound for the Diagonal Poset Ramsey Numbers”, arXiv:2602.16556 (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.