Investigating posets via their maximal chains
From MaRDI portal
Recommendations
Cites work
- A new extension of Lubell's inequality to the lattice of divisors
- A short proof of Sperner's lemma
- A shorter, simpler, stronger proof of the Meshalkin--Hochberg--Hirsch bounds on componentwise antichains
- Convex hulls of more-part Sperner families
- Generalization of Sperner’s Theorem on the Number of Subsets of a Finite Set
- scientific article; zbMATH DE number 3974960 (Why is no real title available?)
- scientific article; zbMATH DE number 3465294 (Why is no real title available?)
- scientific article; zbMATH DE number 1016362 (Why is no real title available?)
- scientific article; zbMATH DE number 1181276 (Why is no real title available?)
- scientific article; zbMATH DE number 5037072 (Why is no real title available?)
- scientific article; zbMATH DE number 3370348 (Why is no real title available?)
- Logarithmic order of free distributive lattice
- On a lemma of Littlewood and Offord
- On generalized graphs
- SPERNER FAMILIES, s‐SYSTEMS, AND A THEOREM OF MESHALKIN†
Cited in
(7)- Families of chains of a poset and Sperner properties
- A generalization of a theorem of Erné about the number of posets with a fixed antichain
- A new extension of Lubell's inequality to the lattice of divisors
- Des chaînes et des antichaînes dans les ensembles ordonnés finis
- scientific article; zbMATH DE number 4027526 (Why is no real title available?)
- On the transitivity coefficients for minimal posets with nonpositive quadratic Tits form
- Some remarks on normalized matching
This page was built for publication: Investigating posets via their maximal chains
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q781532)