An extension of the Erdős–Ko–Rado Theorem

DOI10.1016/j.endm.2007.01.017zbMath1291.05104OpenAlexW2063119667MaRDI QIDQ3439573

Norihide Tokushige

Publication date: 29 May 2007

Published in: Electronic Notes in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.endm.2007.01.017

zbMATH Keywords

Erdős-Ko-Rado theoremintersecting families

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The complete intersection theorem for systems of finite sets
• The exact bound in the Erdős-Ko-Rado theorem
• On the hardness of approximating minimum vertex cover
• The maximum size of 3-wise \(t\)-intersecting families
• EKR type inequalities for 4-wise intersecting families
• On the measure of intersecting families, uniqueness and stability
• 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
• Multiply-intersecting families
• On Sperner families satisfying an additional condition
• The diametric theorem in Hamming spaces---optimal anticodes
• Random walks and multiply intersecting families
• Weighted 3-wise 2-intersecting families
• The complete nontrivial-intersection theorem for systems of finite sets
• Brace-Daykin type inequalities for intersecting families
• Weighted non-trivial multiply intersecting families
• INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
• Extending the Erdős-Ko-Rado theorem
• Weighted multiply intersecting families
• Intersection theorems for systems of finite sets
• A Combinatorial Theorem on Systems of Sets
• SOME INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
• A finite set covering theorem
• On intersecting families of finite sets

This page was built for publication: An extension of the Erdős–Ko–Rado Theorem