Maximal Chains and Antichains in Boolean Lattices

DOI10.1137/0403017zbMath0704.06001OpenAlexW2016965032MaRDI QIDQ3483322

Bill Sands, Peter M. Winkler, Dwight Duffus

Publication date: 1990

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/558db5223b731c4ed0584505c16409a7a664e29e

zbMATH Keywords

Boolean latticecutsetfibremaximal chainsmaximal antichains

Mathematics Subject Classification ID

Partial orders, general (06A06) Structure theory of Boolean algebras (06E05)

Related Items

Edge‐cutsets in the directed hypercube ⋮ Subgraph transversal of graphs ⋮ Cutsets and anti-chains in linear lattices ⋮ Optimal Sets of Questions for Twenty Questions ⋮ Antichains and completely separating systems -- a catalogue and applications ⋮ Fibres and ordered set coloring ⋮ Minimum sized fibres in distributive lattices ⋮ A note on maximal antichains in ordered sets ⋮ On the \(f\)-vectors of cutsets in the Boolean lattice ⋮ On the size of maximal chains and the number of pairwise disjoint maximal antichains ⋮ Minimum cutsets for an element of a Boolean lattice ⋮ Unnamed Item ⋮ Boolean layer cakes ⋮ Packing and covering k-chain free subsets in Boolean lattices ⋮ Posets in which every cutset meets every fibre ⋮ Every cutset meets every fibre in certain poset products