The length of random subsets of Boolean lattices

DOI10.1002/(SICI)1098-2418(200003)16:2%3C177::AID-RSA4%3E3.0.CO;2-9MaRDI QIDQ4948020zbMATH OpenOpenAlexFDO

Authors

Publication date 27 March 2001

Full work available at URL https://doi.org/10.1002/(sici)1098-2418(200003)16:2%3C177::aid-rsa4%3E3.0.co;2-9

zbMATH Keywords

asymptotic behaviorBoolean latticeheightlengthrandom posetwidth

Mathematics Subject Classification ID

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

Recommendations

• The width of random subsets of Boolean lattices
• The dimension of random ordered sets
• Small sublattices in random subsets of Boolean lattices

Cites work

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

Cited in

(9)

• Maximum antichains in random subsets of a finite set
• The width of random subsets of Boolean lattices
• Occupancy problems and random algebras
• Maximum-size antichains in random set-systems
• Existence thresholds and Ramsey properties of random posets
• A random version of Sperner's theorem
• Small sublattices in random subsets of Boolean lattices
• A sharp threshold for a random version of Sperner's theorem
• Hamiltonicity of random subgraphs of the hypercube

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4948020)