On partitions of a partially ordered set

DOI10.1016/0095-8956(77)90052-1zbMath0376.05004OpenAlexW2092643075MaRDI QIDQ1245831

D. E. Schwartz, Alan J. Hoffman

Publication date: 1977

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

Full work available at URL: https://doi.org/10.1016/0095-8956(77)90052-1

Mathematics Subject Classification ID

Partial orders, general (06A06) Combinatorial aspects of partitions of integers (05A17)

Related Items (13)

Semiantichains and Unichain Coverings in Direct Products of Partial Orders ⋮ Switchdec polyhedra ⋮ A short proof of the existence of k-saturated partitions of partially ordered sets ⋮ Critical graphs for chromatic difference sequences ⋮ On chain and antichain families of a partially ordered set ⋮ Berge's conjecture on directed path partitions -- a survey ⋮ On matroid intersections ⋮ On switching paths polyhedra ⋮ Minimax relations for the partial q-colorings of a graph ⋮ Extending Greene's theorem to directed graphs ⋮ A bound for the Dilworth number ⋮ ``Poly-unsaturated posets: The Greene-Kleitman theorem is best possible ⋮ Some sequences associated with combinatorial structures

Cites Work

• Some partitions associated with a partially ordered set
• Strong versions of Sperner's theorem
• Note on Dilworth's Decomposition Theorem for Partially Ordered Sets
• Maximal Flow Through a Network
• A generalization of max flow—min cut
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On partitions of a partially ordered set