Minimum cutsets for an element of a Boolean lattice

DOI10.1007/BF00341634zbMath0689.06010OpenAlexW2002378267MaRDI QIDQ1264164

Daniel J. Kleitman, Jerrold R. Griggs

Publication date: 1989

Published in: Order (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf00341634

zbMATH Keywords

Lubell's inequality for antichainsminimum cutsets

Mathematics Subject Classification ID

Partial orders, general (06A06) Permutations, words, matrices (05A05) Structure theory of Boolean algebras (06E05)

Related Items (3)

Edge‐cutsets in the directed hypercube ⋮ On the \(f\)-vectors of cutsets in the Boolean lattice ⋮ Unnamed Item

Cites Work

• Antichain cutsets
• Finite cutsets and finite antichains
• Cutsets of Boolean lattices
• Convex hulls of more-part Sperner families
• Ramsey-Sperner theory
• Compact Spaces and Spaces of Maximal Complete Subgraphs
• Maximal Chains and Antichains in Boolean Lattices
• Antichains and Finite Sets that Meet all Maximal Chains
• A short proof of Sperner's lemma
• Maximal chains and antichains

This page was built for publication: Minimum cutsets for an element of a Boolean lattice