Greene-Kleitman's theorem for infinite posets
From MaRDI portal
Publication:1207720
DOI10.1007/BF00383948zbMATH Open0766.06004MaRDI QIDQ1207720FDOQ1207720
Authors: Ron Aharoni, Vladimir Korman 
Publication date: 16 May 1993
Published in: Order (Search for Journal in Brave)
Recommendations
- Polyunsaturated posets and graphs and the Greene-Kleitman theorem
- An infinitary version of the Graham-Leeb-Rothschild theorem
- ``Poly-unsaturated posets: The Greene-Kleitman theorem is best possible
- Poset properties of infinite antimatroids
- Algebraic and graph-theoretic properties of infiniten-posets
- Kleiner's theorem for unitary representations of posets
- scientific article; zbMATH DE number 1295194
- An infinite combinatorial statement with a poset parameter
- The poset of infinitary traces
- scientific article; zbMATH DE number 966840
Cites Work
Cited In (15)
- Obstacles to extending Mirsky's theorem
- Polyunsaturated posets and graphs and the Greene-Kleitman theorem
- Some progress on the Aharoni-Korman conjecture
- Menger's theorem for infinite graphs
- A structure theorem for posets admitting a ``strong chain partition: a generalization of a conjecture of Daykin and Daykin (with connections to probability correlation inequalities)
- Strongly perfect infinite graphs
- A note on Dilworth's theorem in the infinite case
- On the duality of semiantichains and unichain coverings.
- On the size of maximal antichains and the number of pairwise disjoint maximal chains
- Infinite matching theory
- Unichain coverings in partial orders with the nested saturation property
- Strongly maximal antichains in posets
- ``Poly-unsaturated posets: The Greene-Kleitman theorem is best possible
- Title not available (Why is that?)
- No finite-infinite antichain duality in the homomorphism poset of directed graphs
This page was built for publication: Greene-Kleitman's theorem for infinite posets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1207720)
