On Sperner families in which no k sets have an empty intersection
From MaRDI portal
Publication:1134158
DOI10.1016/0097-3165(80)90058-8zbMath0423.05004OpenAlexW4213252296MaRDI QIDQ1134158
Publication date: 1980
Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0097-3165(80)90058-8
Related Items
Multiply-intersecting families revisited ⋮ EKR type inequalities for 4-wise intersecting families ⋮ 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 ⋮ Random walks and multiply intersecting families ⋮ Erdös–Ko–Rado Theorem—22 Years Later ⋮ Tight bounds for Katona's shadow intersection theorem ⋮ An extension of the Erdős–Ko–Rado Theorem ⋮ Weighted 3-wise 2-intersecting families ⋮ Polytopes determined by hypergraph classes
Cites Work
- Unnamed Item
- Some results on Sperner families
- On Sperner families satisfying an additional condition
- Existence theorems for Sperner families
- A minimization problem concerning subsets of a finite set
- Intersection theorems for systems of finite sets
- A short proof of Sperner's lemma
- A Combinatorial Theorem on Systems of Sets
