The length of random subsets of Boolean lattices

DOI<177::AID-RSA4>3.0.CO;2-9 10.1002/(SICI)1098-2418(200003)16:2<177::AID-RSA4>3.0.CO;2-9zbMath0973.60018OpenAlexW2022989290MaRDI QIDQ4948020

No author found.

Publication date: 27 March 2001

Full work available at URL: https://doi.org/10.1002/(sici)1098-2418(200003)16:2<177::aid-rsa4>3.0.co;2-9

zbMATH Keywords

heightasymptotic behaviorwidthBoolean latticelengthrandom poset

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Combinatorial probability (60C05)

Related Items

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 ⋮ The width of random subsets of Boolean lattices

Cites Work

• Percolation, first-passage percolation and covering times for Richardson's model on the \(n\)-cube
• Maximum antichains in random subsets of a finite set
• On the diameter and radius of randon subgraphs of the cube
• Connectivity properties of random subgraphs of the cube
• Small sublattices in random subsets of Boolean lattices

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