TOPICS
Search

Boolean Lattice


The Boolean lattice B_n is the partially ordered set consisting of all subsets of an n-set, ordered by inclusion. Equivalently, it is the power set of an n-set regarded as a lattice with meet and join given by intersection and union, respectively.

The elements of rank k in B_n are the k-element subsets, so the kth rank has (n; k) elements. The Hasse diagram of B_n is the n-hypercube graph.


See also

Antichain, Boolean Algebra, Hypercube Graph, Lattice, Partially Ordered Set, Power Set, Sperner's Theorem

Explore with Wolfram|Alpha

References

Balogh, J. and Krueger, R. A. "A Sharp Threshold for a Random Version of Sperner's Theorem." 23 May 2022. https://arxiv.org/abs/2205.11630.Kierstead, H. A. and Trotter, W. T. "Explicit Matchings in the Middle Levels of the Boolean Lattice." Order 5, 163-171, 1988.

Cite this as:

Weisstein, Eric W. "Boolean Lattice." From MathWorld--A Wolfram Resource. https://mathworld.wolfram.com/BooleanLattice.html

Subject classifications