Lu–Thompson conjecture on off-diagonal Boolean-lattice Ramsey numbers

Let QmQ_m and QnQ_n be Boolean lattices of dimensions mm and nn, respectively, with nmn\ge m. Let R(Qm,Qn)R(Q_m,Q_n) be the least dimension of a Boolean lattice such that every blue/red coloring contains a blue copy of QmQ_m or a red copy of QnQ_n.

Lu–Thompson conjecture.

R(Qm,Qn)=o(n2).R(Q_m,Q_n)=o(n^2).

The source presents this as an improvement over the basic quadratic upper bound and notes that the fixed-mm case is already linear. The conjecture concerns the regime in which both dimensions are large.

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.