Weak versus induced poset Ramsey numbers conjecture

Let QnQ_n be the nn-dimensional Boolean lattice. Write R(Qn,Qn)R(Q_n,Q_n) for the induced poset Ramsey number and Rw(Qn,Qn)R^{\mathrm{w}}(Q_n,Q_n) for the weak poset Ramsey number, in which the monochromatic copy need not be induced.

Weak-versus-induced conjecture. For every nNn\in\mathbb{N},

R(Qn,Qn)O(n)Rw(Qn,Qn)R(Qn,Qn).R(Q_n,Q_n)-O(n)\le R^{\mathrm{w}}(Q_n,Q_n)\le R(Q_n,Q_n).

The upper inequality is immediate from the definitions, while the conjecture asserts that the weak and induced diagonal Ramsey numbers differ by at most a linear additive term. The source states that whether the weak number is significantly smaller remains open.

Sources & referencesView supporting material

Primary source

Christian Winter, “Ramsey numbers for partially ordered sets”, arXiv:2409.08819 (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.