The width of random subsets of Boolean lattices

DOI10.1006/jcta.2002.3293zbMath1015.05090OpenAlexW2003200680MaRDI QIDQ1865401

Yanyan Li

Publication date: 26 March 2003

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

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

zbMATH Keywords

Boolean latticeSperner familyrandom hypergraph

Mathematics Subject Classification ID

Combinatorics of partially ordered sets (06A07) Combinatorial probability (60C05) Extremal set theory (05D05) Probabilistic methods in extremal combinatorics, including polynomial methods (combinatorial Nullstellensatz, etc.) (05D40)

Related Items (4)

A random version of Sperner's theorem ⋮ Existence thresholds and Ramsey properties of random posets ⋮ Maximum-size antichains in random set-systems ⋮ Maximum antichains in random subsets of a finite set

Cites Work

• Percolation, first-passage percolation and covering times for Richardson's model on the \(n\)-cube
• The height of a random partial order: Concentration of measure
• Maximum antichains in random subsets of a finite set
• Box-Spaces and Random Partial Orders
• On the diameter and radius of randon subgraphs of the cube
• Small sublattices in random subsets of Boolean lattices
• The length of random subsets of Boolean lattices
• A short proof of Sperner's lemma
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: The width of random subsets of Boolean lattices