A tour of \(M\)-part \(L\)-Sperner families
From MaRDI portal
Publication:618322
DOI10.1016/j.jcta.2010.09.006zbMath1244.05218OpenAlexW2023030816MaRDI QIDQ618322
László A. Székely, Éva Czabarka, Harout Aydinian, Péter L. Erdős
Publication date: 14 January 2011
Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jcta.2010.09.006
homogeneityantichainextremal set theorytransversalconvex hull methodSperner theorem\(M\)-part Sperner familyBLYM inequality
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An identity in combinatorial extremal theory
- Extremal hypergraph problems and convex hulls
- A Ramsey-Sperner theorem
- k-color Sperner theorems
- All maximum 2-part Sperner families
- A note on convex hulls of more-part Sperner families
- Convex hulls of more-part Sperner families
- The Littlewood-Offord problem: Tightest packing and an M-part Sperner theorem
- A three part Sperner theorem
- On the structure of maximum 2-part Sperner families
- Ramsey-Sperner theory
- On a lemma of Littlewood and Offord on the distribution of certain sums
- A generalization of results of P. Erdős, G. Katona, and D. J. Kleitman concerning Sperner's theorem
- A generalization of some generalizations of Sperner's theorem
- Polynomial LYM inequalities
- Logarithmic order of free distributive lattice
- A Remark on Stirling's Formula
- A weighted matroid intersection algorithm
- Another Three Part Sperner Theorem
- All Maximum Size Two-Part Sperner Systems: In Short
- Two-Part and k-Sperner Families: New Proofs Using Permutations
- On generalized graphs
- A short proof of Sperner's lemma
- Generalization of Sperner’s Theorem on the Number of Subsets of a Finite Set
- On a lemma of Littlewood and Offord
This page was built for publication: A tour of \(M\)-part \(L\)-Sperner families
