Minimum sized fibres in distributive lattices

DOI10.1017/S144678870000238XzbMath1019.06002OpenAlexW2136516706MaRDI QIDQ2747265

Dwight Duffus, Bill Sands

Publication date: 16 September 2003

Published in: Journal of the Australian Mathematical Society (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1017/s144678870000238x

zbMATH Keywords

antichaindistributive latticefibre

Mathematics Subject Classification ID

Combinatorics of partially ordered sets (06A07) Structure and representation theory of distributive lattices (06D05)

Related Items (2)

Optimal Sets of Questions for Twenty Questions ⋮ Packing and covering k-chain free subsets in Boolean lattices

Cites Work

• A size-width inequality for distributive lattices
• Chains, antichains, and fibres
• A minimal cutset of the Boolean lattice with almost all members
• Splitting property in infinite posets
• On the widths of finite distributive lattices
• A splitting property of maximal antichains
• Long symmetric chains in the Boolean lattice
• Maximal Chains and Antichains in Boolean Lattices

This page was built for publication: Minimum sized fibres in distributive lattices