Families of chains of a poset and Sperner properties
From MaRDI portal
Publication:1356768
DOI10.1016/S0012-365X(96)00190-2zbMATH Open0871.06001MaRDI QIDQ1356768FDOQ1356768
Publication date: 10 June 1997
Published in: Discrete Mathematics (Search for Journal in Brave)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Some Results on Matching in Bipartite Graphs
- Logarithmic order of free distributive lattice
- A decomposition theorem for partially ordered sets
- On chain and antichain families of a partially ordered set
- A short proof of Sperner's lemma
- Generalization of Sperner’s Theorem on the Number of Subsets of a Finite Set
- The structure of Sperner k-families
- On chains and Sperner k-families in ranked posets
- Collections of Subsets with the Sperner Property
- Maximum antichains in the product of chains
- A finite Coxeter group the weak Bruhat order of which is not symmetric chain
Cited In (1)
Recommendations
- Categories of chain-complete posets 👍 👎
- Poset-free families and Lubell-boundedness 👍 👎
- Families of subsets without a given poset in double chains and Boolean lattices 👍 👎
- 2-chains: An interesting family of posets 👍 👎
- Investigating posets via their maximal chains 👍 👎
- A new approach to Sperner-type properties of a poset 👍 👎
- A characterisation of posets that are nearly antichains 👍 👎
- Des chaînes et des antichaînes dans les ensembles ordonnés finis 👍 👎
- Positive families and Boolean chains of copies of ultrahomogeneous structures 👍 👎
- SOME FAMILIES OF IDEAL-HOMOGENEOUS POSETS 👍 👎
This page was built for publication: Families of chains of a poset and Sperner properties
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1356768)