On Sperner families in which no k sets have an empty intersection. III
From MaRDI portal
Publication:1167724
DOI10.1007/BF02579279zbMath0492.05001MaRDI QIDQ1167724
Publication date: 1982
Published in: Combinatorica (Search for Journal in Brave)
Related Items
A product version of the Erdős-Ko-Rado theorem, EKR type inequalities for 4-wise intersecting families, Sperner type theorems and complexity of minimal disjunctive normal forms of monotone Boolean functions, Random walks and multiply intersecting families, Weighted 3-wise 2-intersecting families, Multiply-intersecting families revisited, An extension of the Erdős–Ko–Rado Theorem
Cites Work
- Unnamed Item
- Some results on Sperner families
- On Sperner families in which no k sets have an empty intersection
- Extremal problems and coverings of the space
- On Sperner families in which no k sets have an empty intersection. II
- On Sperner families satisfying an additional condition
- On t-designs
- Existence theorems for Sperner families
- A minimization problem concerning subsets of a finite set
- Logarithmic order of free distributive lattice
- INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
- Families of finite sets with prescribed cardinalities for pairwise intersections
- Intersection Properties of Systems of Finite Sets
- A short proof of Sperner's lemma
- SOME INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
- Generalization of Sperner’s Theorem on the Number of Subsets of a Finite Set
