The asymptotic Boolean-lattice Ramsey conjecture

Let QmQ_m and QnQ_n denote Boolean lattices of dimensions mm and nn, respectively, and let R(Qm,Qn)R(Q_m,Q_n) be their poset Ramsey number.

Boolean-lattice asymptotic conjecture. For every fixed mNm\in\mathbb{N},

R(Qm,Qn)=n+o(n).R(Q_m,Q_n)=n+o(n).

Furthermore, there is a fixed integer mNm\in\mathbb{N} with

R(Qm,Qn)=n+ω(nlogn).R(Q_m,Q_n)=n+\omega\left(\frac{n}{\log n}\right).

The paper states that this is equivalent to the preceding conjectures for fixed posets and for the existence of a non-modest poset. Determining these Ramsey numbers is a central open problem, with the asymptotic behavior for fixed m3m\geq 3 currently known only within a constant linear factor.

Sources & referencesView supporting material

Primary source

Christian Winter, “Poset Ramsey number R(P,Q_n). III. Chain Compositions and Antichains”, arXiv:2303.04462 (2023).

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.