Maximum antichains in random subsets of a finite set

DOI10.1006/jcta.1999.3048zbMath0949.05084OpenAlexW2003315074MaRDI QIDQ1570763

Deryk Osthus

Publication date: 29 November 2000

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

Full work available at URL: https://doi.org/10.1006/jcta.1999.3048

zbMATH Keywords

Sperner theoremrandom posetchain covers

Mathematics Subject Classification ID

Extremal set theory (05D05)

Related Items (8)

The length of random subsets of Boolean lattices ⋮ On some extremal and probabilistic questions for tree posets ⋮ Improved bounds for cross-Sperner systems ⋮ A random version of Sperner's theorem ⋮ On Erdős–Ko–Rado for Random Hypergraphs II ⋮ Existence thresholds and Ramsey properties of random posets ⋮ Maximum-size antichains in random set-systems ⋮ The width of random subsets of Boolean lattices

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The width of random subsets of Boolean lattices
• Poisson approximation for large deviations
• Small sublattices in random subsets of Boolean lattices
• The length of random subsets of Boolean lattices
• A short proof of Sperner's lemma

This page was built for publication: Maximum antichains in random subsets of a finite set