On Sperner families in which no k sets have an empty intersection. III

DOI10.1007/BF02579279zbMath0492.05001OpenAlexW2054050056MaRDI QIDQ1167724

Hans-Dietrich O. F. Gronau

Publication date: 1982

Published in: Combinatorica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02579279

zbMATH Keywords

subsetsSperner family

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Hypergraphs (05C65) Permutations, words, matrices (05A05)

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, The maximum measure of 3-wise \(t\)-intersecting families, The maximum size of intersecting and union families of sets, A product version of the Erdős-Ko-Rado theorem, Random walks and multiply intersecting families, On r-Cross Intersecting Families of Sets, An extension of the Erdős–Ko–Rado Theorem, Weighted 3-wise 2-intersecting families

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