A random version of Sperner's theorem

DOI10.1016/j.jcta.2014.08.003zbMath1301.05347arXiv1404.5079OpenAlexW2111375633MaRDI QIDQ458289

József Balogh, Richard Mycroft, Andrew Treglown

Publication date: 7 October 2014

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1404.5079

zbMATH Keywords

antichainBoolean latticecontainer method

Mathematics Subject Classification ID

Combinatorics of partially ordered sets (06A07) Extremal set theory (05D05)

Related Items (12)

Online containers for hypergraphs, with applications to linear equations ⋮ Supersaturation, counting, and randomness in forbidden subposet problems ⋮ Multicolor chain avoidance in the Boolean lattice ⋮ Supersaturation in posets and applications involving the container method ⋮ Applications of graph containers in the Boolean lattice ⋮ Uniform chain decompositions and applications ⋮ On some extremal and probabilistic questions for tree posets ⋮ Improved bounds for cross-Sperner systems ⋮ On the number of points in general position in the plane ⋮ On Erdős–Ko–Rado for Random Hypergraphs II ⋮ Existence thresholds and Ramsey properties of random posets ⋮ Maximum-size antichains in random set-systems

Cites Work

• Unnamed Item
• Unnamed Item
• Hypergraph containers
• The height of a random partial order: Concentration of measure
• Maximum antichains in random subsets of a finite set
• The width of random subsets of Boolean lattices
• Maximum-size antichains in random set-systems
• Small sublattices in random subsets of Boolean lattices
• The length of random subsets of Boolean lattices
• Sperner's Theorem and a Problem of Erdős, Katona and Kleitman

This page was built for publication: A random version of Sperner's theorem