Three-layer conjecture for maximum antichains in a random subset of the Boolean lattice

Let P(n)p\mathcal{P}(n)_p be the random subfamily of the Boolean lattice P(n)\mathcal{P}(n) obtained by including each subset independently with probability pp, and let a maximum antichain be an antichain of largest possible size in P(n)p\mathcal{P}(n)_p. Here p=ω(1/n)p=\omega(1/n) means that pnpn\to\infty as nn\to\infty. Three-layer conjecture. For p=ω(1/n)p=\omega(1/n), every maximum antichain of P(n)p\mathcal{P}(n)_p is contained in three consecutive layers, with high probability. The conjecture proposes that above the threshold at which the width is asymptotically equal to the size of a middle layer, maximum antichains are localized near the middle and have only a bounded number of layers of support; the paper proves the corresponding structural description for constant p>1/2p>1/2, while the asserted range p=ω(1/n)p=\omega(1/n) remains open.

Sources & referencesView supporting material

Primary source

József Balogh and Robert A. Krueger, “A sharp threshold for a random version of Sperner's Theorem”, arXiv:2205.11630 (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.