A chain decomposition theorem
From MaRDI portal
The author proves that a poset (1) such that every point together with a finite set of elements incomparable with it form a cutset and (2) such that any bounded countable chain has sup and inf is the union of countably many chains. The proof uses the height of a poset of 2 element chains.
Recommendations
Cites work
- A decomposition theorem for partially ordered sets
- A partition calculus in set theory
- Antichains and Finite Sets that Meet all Maximal Chains
- Compact Spaces and Spaces of Maximal Complete Subgraphs
- Compactness and subsets of ordered sets that meet all maximal chains
- Directed Sets and Cofinal Types
- Extensions of ordered sets having the finite cutset property
- Finite cutsets and finite antichains
- scientific article; zbMATH DE number 3957179 (Why is no real title available?)
- scientific article; zbMATH DE number 3677903 (Why is no real title available?)
- Maximal chains and antichains
- On Dilworth's theorem in the infinite case
- The Cofinality of a Partially Ordered Set
- Theory of relations. Transl. from the French by P. Clote
Cited in
(7)- Chaines alternées. (Alternating chains)
- A note on Dilworth's theorem in the infinite case
- Decompositions of partially ordered sets into chains and antichains of given size
- On the decomposition of order-separable posets of countable width into chains
- A Proof of Dilworth's Chain Decomposition Theorem
- scientific article; zbMATH DE number 2171500 (Why is no real title available?)
- Cut-sets in infinite graphs and partial orders
This page was built for publication: A chain decomposition theorem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1109796)
