Random walks and multiply intersecting families

DOI10.1016/j.jcta.2004.08.001zbMath1057.05076OpenAlexW2098919373MaRDI QIDQ1763876

Peter Frankl, Norihide Tokushige

Publication date: 22 February 2005

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jcta.2004.08.001

zbMATH Keywords

intersecting familyrandom walkSperner family

Mathematics Subject Classification ID

Extremal set theory (05D05)

Related Items

Multiply-intersecting families revisited ⋮ EKR type inequalities for 4-wise intersecting families ⋮ The maximum size of intersecting and union families of sets ⋮ A multiply intersecting Erdős-Ko-Rado theorem -- the principal case ⋮ 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 ⋮ An extension of the Erdős–Ko–Rado Theorem

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The complete intersection theorem for systems of finite sets
• On Sperner families in which no k sets have an empty intersection
• On Sperner families in which no k sets have an empty intersection. II
• On Sperner families in which no k sets have an empty intersection. III
• On Sperner families satisfying an additional condition
• Weighted 3-wise 2-intersecting families
• Weighted non-trivial multiply intersecting families
• INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
• Weighted multiply intersecting families
• Intersection theorems for systems of finite sets
• A Combinatorial Theorem on Systems of Sets