Subpolynomial-factor conjecture for diagonal poset Ramsey numbers

Let QnQ_n denote the Boolean lattice of subsets of an nn-element set, let R(Qm,Qn)R(Q_m,Q_n) be the induced poset Ramsey number, and let ε>0\varepsilon>0. Subpolynomial-factor conjecture. There is a large enough m0m_0 such that for any m,nNm,n\in\mathbb{N} with nmm0n\ge m\ge m_0,

R(Qm,Qn)nmε.R(Q_m,Q_n)\le n\cdot m^{\varepsilon}.

This is proposed as a stronger version of the Lu–Thompson subquadratic conjecture. The source gives no resolution, so the conjecture remains open.

Sources & referencesView supporting material

Primary source

Maria Axenovich and Christian Winter, “Diagonal poset Ramsey numbers”, arXiv:2402.13423 (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.