The maximum size of intersecting and union families of sets

DOI10.1016/j.ejc.2011.08.004zbMath1238.05268OpenAlexW2137230158MaRDI QIDQ657996

Norihide Tokushige, Mark H. Siggers

Publication date: 11 January 2012

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejc.2011.08.004

zbMATH Keywords

Erdős-Ko-Rado theoremintersecting families of setsKleitman inequalityrandom walk methodunion families of sets

Mathematics Subject Classification ID

Extremal set theory (05D05)

Related Items (2)

Set Systems with L-Intersections and k-Wise L-Intersecting Families ⋮ Invitation to intersection problems for finite sets

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The maximum size of 3-wise \(t\)-intersecting families
• EKR type inequalities for 4-wise intersecting families
• A multiply intersecting Erdős-Ko-Rado theorem -- the principal case
• On the measure of intersecting families, uniqueness and stability
• On Sperner families in which no k sets have an empty intersection. III
• The proof of a conjecture of G. O. H. Katona
• On t-designs
• Intersection theorems and a lemma of Kleitman
• Random walks and multiply intersecting families
• Weighted 3-wise 2-intersecting families
• Proof of a conjecture of Erdős on triangles in set-systems
• An intersection theorem for four sets
• Multiply-intersecting families revisited
• Brace-Daykin type inequalities for intersecting families
• The maximum size of 4-wise 2-intersecting and 4-wise 2-union families
• The maximum size of 3-wise intersecting and 3-wise union families
• INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
• Simplex Stability
• Intersecting Families are Essentially Contained in Juntas
• The Number of Values of a Boolean Function
• On incomparable collections of sets
• Weighted multiply intersecting families
• Families of Non-disjoint subsets
• Differences of Sets and A Problem of Graham
• A finite set covering theorem

This page was built for publication: The maximum size of intersecting and union families of sets