Interval stability and interval covering property in finite posets
DOI10.1007/BF00814408zbMATH Open0773.06004OpenAlexW2073847908MaRDI QIDQ1803666FDOQ1803666
Authors: Isma Bouchemakh, Konrad Engel 
Publication date: 29 June 1993
Published in: Order (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf00814408
Recommendations
NP-completenessSperner propertysymmetric chain ordersPeck posetsinterval stabilityshuffle posetschain productsinterval covering
Analysis of algorithms and problem complexity (68Q25) Combinatorics of partially ordered sets (06A07)
Cites Work
- Title not available (Why is that?)
- Weyl Groups, the Hard Lefschetz Theorem, and the Sperner Property
- Title not available (Why is that?)
- A decomposition theorem for partially ordered sets
- Title not available (Why is that?)
- A partition of L(3,n) into saturated symmetric chains
- A symmetric chain decomposition of L(4,n)
- Title not available (Why is that?)
- Sufficient Conditions for a Symmetric Chain Order
- Title not available (Why is that?)
- Title not available (Why is that?)
- Posets of shuffles
- Title not available (Why is that?)
- Boolesche Minimalpolynome und Überdeckungsprobleme
Cited In (7)
- On the domatic and the total domatic numbers of the 2-section graph of the order-interval hypergraph of the finite poset
- The order-interval hypergraph of a finite poset and the König property
- Covering a poset by interval orders
- Interval number of special posets and random posets
- 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
- Removing redundant refusals: minimal complete test suites for failure trace semantics
This page was built for publication: Interval stability and interval covering property in finite posets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1803666)
