Existence of a non-modest poset

Let PP be a fixed non-trivial finite poset, and let QnQ_n be the nn-dimensional Boolean lattice. Call PP modest if

R(P,Qn)=n+Θ(nlogn).R(P,Q_n)=n+\Theta\left(\frac{n}{\log n}\right).

Non-modest poset conjecture. There is a fixed poset PP such that

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

Known results establish the lower bound R(P,Qn)=n+Ω(n/logn)R(P,Q_n)=n+\Omega(n/\log n) for every non-trivial PP, and show that several classes are modest. Whether any non-modest poset exists remains open.

Sources & referencesView supporting material

Primary source

Christian Winter, “Ramsey numbers for partially ordered sets”, arXiv:2409.08819 (2024).

Additional references

2 papers in this index state this conjecture (2023–2024). The statement above is taken from the most recent of them; the others are arXiv:2303.04462.

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.