A minimal cutset of the Boolean lattice with almost all members

DOI10.1007/BF01788687zbMath0687.05002OpenAlexW1987434516MaRDI QIDQ1262863

Daniel J. Kleitman, Jerrold R. Griggs, Zoltan Fueredi

Publication date: 1989

Published in: Graphs and Combinatorics (Search for Journal in Brave)

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

zbMATH Keywords

Boolean latticecutsetsmaximal chains

Mathematics Subject Classification ID

Permutations, words, matrices (05A05)

Related Items

Edge‐cutsets in the directed hypercube ⋮ Cutsets and anti-chains in linear lattices ⋮ Large convex cones in hypercubes ⋮ Minimum sized fibres in distributive lattices ⋮ On the \(f\)-vectors of cutsets in the Boolean lattice ⋮ Unnamed Item ⋮ Packing and covering k-chain free subsets in Boolean lattices ⋮ Large Convex Cones in Hypercubes

Cites Work

• Unnamed Item
• Finite cutsets and finite antichains
• Cutsets of Boolean lattices
• Sphere coverings of the hypercube with incomparable centers
• Antichains and Finite Sets that Meet all Maximal Chains