On Sperner families in which no k sets have an empty intersection. II
From MaRDI portal
Publication:1157326
DOI10.1016/0097-3165(81)90025-XzbMath0471.05001MaRDI QIDQ1157326
Publication date: 1981
Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)
Related Items (8)
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. III ⋮ Random walks and multiply intersecting families ⋮ Erdös–Ko–Rado Theorem—22 Years Later ⋮ An extension of the Erdős–Ko–Rado Theorem ⋮ Weighted 3-wise 2-intersecting families
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Some results on Sperner families
- On Sperner families in which no k sets have an empty intersection
- On Sperner families satisfying an additional condition
- Existence theorems for Sperner families
- A minimization problem concerning subsets of a finite set
- A short proof of Sperner's lemma
- A Combinatorial Theorem on Systems of Sets
This page was built for publication: On Sperner families in which no k sets have an empty intersection. II
