Some results on Sperner families
From MaRDI portal
Publication:1132876
Cites work
- A generalization of a combinatorial theorem of macaulay
- A minimization problem concerning subsets of a finite set
- A short proof of Sperner's lemma
- A simple proof of the Kruskal-Katona theorem
- A simple proof of the Kruskal-Katona theorem and of some associated binomial inequalities
- Existence theorems for Sperner families
- Extremal problems for finite sets and convex hulls---a survey
- scientific article; zbMATH DE number 3517154 (Why is no real title available?)
- scientific article; zbMATH DE number 3573875 (Why is no real title available?)
- scientific article; zbMATH DE number 3189757 (Why is no real title available?)
- INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
- On Sperner families satisfying an additional condition
- Sperner systems consisting of pairs of complementary subsets
Cited in
(9)- On Sperner families in which no k sets have an empty intersection
- On maximal families of subsets of a finite set
- Sperner type theorems and complexity of minimal disjunctive normal forms of monotone Boolean functions
- On Sperner families in which no k sets have an empty intersection. II
- On Sperner families in which no k sets have an empty intersection. III
- Sharpening the LYM inequality
- Combinatorial analysis. (Matrix problems, choice theory)
- Polytopes determined by complementfree Sperner families
- Sperner families satisfying additional conditions and their convex hulls
This page was built for publication: Some results on Sperner families
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1132876)