Maximum-size antichains in random set-systems

DOI10.1002/rsa.20647zbMath1344.05142arXiv1404.5258OpenAlexW2592188585MaRDI QIDQ2820272

Maurício Collares, Robert Morris

Publication date: 15 September 2016

Published in: Random Structures & Algorithms (Search for Journal in Brave)

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

zbMATH Keywords

antichainshypergraph containersrandom set-systems

Mathematics Subject Classification ID

Hypergraphs (05C65) Extremal set theory (05D05)

Related Items (11)

The number of \(C_{2\ell}\)-free graphs ⋮ Supersaturation, counting, and randomness in forbidden subposet problems ⋮ Multicolor chain avoidance in the Boolean lattice ⋮ Supersaturation in posets and applications involving the container method ⋮ On some extremal and probabilistic questions for tree posets ⋮ Improved bounds for cross-Sperner systems ⋮ A random version of Sperner's theorem ⋮ 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 ⋮ Colouring set families without monochromatic \(k\)-chains

Cites Work

• Combinatorial theorems in sparse random sets
• A random version of Sperner's theorem
• Hypergraph containers
• Maximum antichains in random subsets of a finite set
• The width of random subsets of Boolean lattices
• Logarithmic order of free distributive lattice
• Small sublattices in random subsets of Boolean lattices
• The length of random subsets of Boolean lattices
• Independent sets in hypergraphs
• Sperner's Theorem and a Problem of Erdős, Katona and Kleitman
• On generalized graphs
• A short proof of Sperner's lemma
• On a lemma of Littlewood and Offord

This page was built for publication: Maximum-size antichains in random set-systems