Interval stability and interval covering property in finite posets
From MaRDI portal
(Redirected from Publication:1803666)
Recommendations
Cites work
- scientific article; zbMATH DE number 3645097 (Why is no real title available?)
- scientific article; zbMATH DE number 4171748 (Why is no real title available?)
- scientific article; zbMATH DE number 4179291 (Why is no real title available?)
- scientific article; zbMATH DE number 4063157 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 3400923 (Why is no real title available?)
- scientific article; zbMATH DE number 3065933 (Why is no real title available?)
- A decomposition theorem for partially ordered sets
- A partition of L(3,n) into saturated symmetric chains
- A symmetric chain decomposition of L(4,n)
- Boolesche Minimalpolynome und Überdeckungsprobleme
- Posets of shuffles
- Sufficient Conditions for a Symmetric Chain Order
- Weyl Groups, the Hard Lefschetz Theorem, and the Sperner Property
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)