A new short proof of the EKR theorem

DOI10.1016/j.jcta.2012.03.012zbMath1244.05008arXiv1108.2179OpenAlexW2156250987WikidataQ101132835 ScholiaQ101132835MaRDI QIDQ423657

Peter Frankl, Zoltan Fueredi

Publication date: 4 June 2012

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

Full work available at URL: https://arxiv.org/abs/1108.2179

zbMATH Keywords

shadowsErdős-Ko-Radomultilinear polynomialsgeneralized characteristic vectorsintersecting hypergraphs

Mathematics Subject Classification ID

Permutations, words, matrices (05A05)

Related Items

The maximum product of sizes of cross-intersecting families, EKR sets for large \(n\) and \(r\), The Katona cycle proof of the Erdős-Ko-Rado theorem and its possibilities, Size and structure of large \((s,t)\)-union intersecting families, The maximum sum of sizes of cross-intersecting families of subsets of a set, On intersecting families of independent sets in trees, An improved universal bound for \(t\)-intersecting families, Cross-intersecting subfamilies of levels of hereditary families, An algebraic groups perspective on Erdős–Ko–Rado, Cross-intersecting non-empty uniform subfamilies of hereditary families, Erdös-Ko-Rado theorems for a family of trees, Restricted intersecting families on simplicial complex, A note on supersaturated set systems, New injective proofs of the Erdős-Ko-Rado and Hilton-Milner theorems, Sharp results concerning disjoint cross-intersecting families, Intersecting families, signed sets, and injection, Extremal \(G\)-free induced subgraphs of Kneser graphs, Old and new applications of Katona's circle, Invitation to intersection problems for finite sets, On the arithmetic mean of the size of cross-union families, Tight bounds for Katona's shadow intersection theorem, A short proof of Talbot's theorem for intersecting separated sets, The Hilton-Spencer cycle theorems via Katona's shadow intersection theorem

Cites Work

• Unnamed Item
• Unnamed Item
• The exact bound in the Erdős-Ko-Rado theorem
• On the measure of intersecting families, uniqueness and stability
• Intersection theorems with geometric consequences
• On t-designs
• Forestation in hypergraphs: Linear \(k\)-trees
• Erdős-Ko-Rado from Kruskal-Katona
• A sharp bound for the number of sets that pairwise intersect at \(k\) positive values
• A simple proof of the Erdős-Chao Ko-Rado theorem
• Erdös–Ko–Rado Theorem—22 Years Later
• INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
• Intersecting Families are Essentially Contained in Juntas
• Intersection theorems for systems of finite sets