Three-layer conjecture for maximum antichains in a random subset of the Boolean lattice
Three-layer conjecture for maximum antichains in a random subset of the Boolean lattice
Let be the random subfamily of the Boolean lattice obtained by including each subset independently with probability , and let a maximum antichain be an antichain of largest possible size in . Here means that as . Three-layer conjecture. For , every maximum antichain of 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 , while the asserted range 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
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.