A random version of Sperner's theorem

  title={A random version of Sperner's theorem},
  author={J{\'o}zsef Balogh and Richard Mycroft and Andrew Treglown},
  journal={J. Comb. Theory, Ser. A},
Let P(n) denote the power set of [n], ordered by inclusion, and let P(n, p) be obtained from P(n) by selecting elements from P(n) independently at random with probability p. A classical result of Sperner [12] asserts that every antichain in P(n) has size at most that of the middle layer, ( n ⌊n/2⌋ ) . In this note we prove an analogous result for P(n, p): If pn → ∞ then, with high probability, the size of the largest antichain in P(n, p) is at most (1+ o(1))p ( n ⌊n/2⌋ ) . This solves a… CONTINUE READING

From This Paper

Topics from this paper.
3 Citations
9 References
Similar Papers


Publications citing this paper.


Publications referenced by this paper.
Showing 1-9 of 9 references

Ein Satz über Untermengen einer endlichen

  • E. Sperner
  • Menge, Math. Zeit
  • 1928
Highly Influential
4 Excerpts

A conjecture of Erdős–Katona on commensurable pairs among subsets of an n-set

  • D. Kleitman
  • Theory of Graphs,
  • 1966
Highly Influential
3 Excerpts

The height of a random partial order: Concentration of measure

  • B. Bollobás, G. Brightwell
  • Ann. Appl. Probab
  • 1992
1 Excerpt

On random subsets of a finite set, Mathematica (Cluj) 3, No

  • A. Rényi
  • 1961
2 Excerpts

Similar Papers

Loading similar papers…