Two easy duality theorems for product partial orders

DOI10.1016/0166-218X(87)90065-5zbMath0626.06001MaRDI QIDQ580378

Douglas B. West, Leslie E. jun. Trotter

Publication date: 1987

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

duality theoremspartial orderscovering by semiantichainsdirect product of posetslargest unichain

Mathematics Subject Classification ID

Partial orders, general (06A06) Combinatorial identities, bijective combinatorics (05A19) Combinatorial aspects of packing and covering (05B40)

Related Items (3)

News about Semiantichains and Unichain Coverings ⋮ On the duality of semiantichains and unichain coverings. ⋮ Networks and chain coverings in partial orders and their products

Cites Work

• Unnamed Item
• Some partitions associated with a partially ordered set
• A proof of Dilworth's decomposition theorem for partially ordered sets
• A decomposition theorem for partially ordered sets
• The NP-Completeness of Edge-Coloring
• Semiantichains and Unichain Coverings in Direct Products of Partial Orders
• Paths, Trees, and Flowers
• Minimum partition of a matroid into independent subsets
• Blocking and anti-blocking pairs of polyhedra
• Matroids and the greedy algorithm
• The structure of Sperner k-families

This page was built for publication: Two easy duality theorems for product partial orders