The maximum size of 3-wise \(t\)-intersecting families

DOI10.1016/j.ejc.2005.07.012zbMath1110.05096OpenAlexW2016392911MaRDI QIDQ854817

Norihide Tokushige

Publication date: 7 December 2006

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

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

zbMATH Keywords

Erdős-Ko-Rado theoremrandom walkshifting technique

Mathematics Subject Classification ID

Hypergraphs (05C65) Extremal set theory (05D05)

Related Items (7)

Multiply-intersecting families revisited ⋮ EKR type inequalities for 4-wise intersecting families ⋮ The maximum measure of 3-wise \(t\)-intersecting families ⋮ The maximum size of intersecting and union families of sets ⋮ A multiply intersecting Erdős-Ko-Rado theorem -- the principal case ⋮ A product version of the Erdős-Ko-Rado theorem ⋮ An extension of the Erdős–Ko–Rado Theorem

Cites Work

• Unnamed Item
• The complete intersection theorem for systems of finite sets
• The exact bound in the Erdős-Ko-Rado theorem
• The maximum size of 4-wise 2-intersecting and 4-wise 2-union families
• INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
• Families of finite sets satisfying an intersection condition

This page was built for publication: The maximum size of 3-wise \(t\)-intersecting families