Interval stability and interval covering property in finite posets
From MaRDI portal
Publication:1803666
DOI10.1007/BF00814408zbMath0773.06004OpenAlexW2073847908MaRDI QIDQ1803666
Publication date: 29 June 1993
Published in: Order (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf00814408
NP-completenessSperner propertysymmetric chain ordersPeck posetsinterval stabilityshuffle posetschain productsinterval covering
Analysis of algorithms and problem complexity (68Q25) Combinatorics of partially ordered sets (06A07)
Related Items
The order-interval hypergraph of a finite poset and the König property ⋮ Removing redundant refusals: minimal complete test suites for failure trace semantics ⋮ Interval Packing and Covering in the Boolean Lattice ⋮ On the domatic and the total domatic numbers of the 2-section graph of the order-interval hypergraph of a finite poset ⋮ On the domatic and the total domatic numbers of the 2-section graph of the order-interval hypergraph of the finite poset
Cites Work
- Posets of shuffles
- A partition of L(3,n) into saturated symmetric chains
- A symmetric chain decomposition of L(4,n)
- Boolesche Minimalpolynome und Überdeckungsprobleme
- A decomposition theorem for partially ordered sets
- Weyl Groups, the Hard Lefschetz Theorem, and the Sperner Property
- Sufficient Conditions for a Symmetric Chain Order
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item