Covering a poset by interval orders

DOI10.1016/0097-3165(94)90057-4MaRDI QIDQ1323838zbMATH OpenOpenAlexFDO

Authors Douglas B. West

Publication date 17 November 1994

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(94)90057-4

zbMATH Keywords

finite posetcovering by interval orders

Mathematics Subject Classification ID

Combinatorics of partially ordered sets (06A07) Combinatorial aspects of packing and covering (05B40)

Recommendations

• Interval number of special posets and random posets
• Interval orders and dimension
• Interval stability and interval covering property in finite posets
• A simple proof characterizing interval orders with interval lengths between 1 and \(k\)
• scientific article; zbMATH DE number 3857173

Cites work

• scientific article; zbMATH DE number 3558962 (Why is no real title available?)
• A decomposition theorem for partially ordered sets
• Intransitive indifference with unequal indifference intervals

Cited in

(6)

• Covering a symmetric poset by symmetric chains
• Height of a superposition
• Interval number of special posets and random posets
• Interval stability and interval covering property in finite posets
• Set Covering with Ordered Replacement: Additive and Multiplicative Gaps
• Covering posets

This page was built for publication: Covering a poset by interval orders

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1323838)