``Poly-unsaturated posets: The Greene-Kleitman theorem is best possible

DOI10.1016/0097-3165(86)90118-4zbMath0583.06002OpenAlexW2058520251MaRDI QIDQ1069961

Douglas B. West

Publication date: 1986

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0097-3165(86)90118-4

zbMATH Keywords

heightwidthposetscounterexampleslinear extensionscompletely saturated antichain partitioncompletely saturated chain partitionGreene-Kleitman Theorem

Mathematics Subject Classification ID

Partial orders, general (06A06) Permutations, words, matrices (05A05) Graph theory (05C99) Combinatorial aspects of packing and covering (05B40)

Related Items

Unichain coverings in partial orders with the nested saturation property ⋮ On the duality of semiantichains and unichain coverings. ⋮ Some sequences associated with combinatorial structures

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unichain coverings in partial orders with the nested saturation property
• A short proof of the existence of k-saturated partitions of partially ordered sets
• On chain and antichain families of a partially ordered set
• Some partitions associated with a partially ordered set
• On partitions of a partially ordered set
• A decomposition theorem for partially ordered sets
• Semiantichains and Unichain Coverings in Direct Products of Partial Orders
• The structure of Sperner k-families

This page was built for publication: ``Poly-unsaturated posets: The Greene-Kleitman theorem is best possible