The Katona cycle proof of the Erdős-Ko-Rado theorem and its possibilities

DOI10.1007/s10801-016-0670-1zbMath1408.05132OpenAlexW2283497383MaRDI QIDQ295831

Karen Meagher, Peter Borg

Publication date: 13 June 2016

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

Full work available at URL: https://doi.org/10.1007/s10801-016-0670-1

zbMATH Keywords

Erdős-Ko-Rado theoremgraph homomorphismKatona's cycle proof

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Extremal set theory (05D05)

Related Items (1)

Old and new applications of Katona's circle

Uses Software

• MathOverflow

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A Hilton-Milner-type theorem and an intersection conjecture for signed sets
• A generalization of the Erdős-Ko-Rado theorem to \(t\)-designs in certain semilattices
• A new short proof of the EKR theorem
• The complete intersection theorem for systems of finite sets
• The exact bound in the Erdős-Ko-Rado theorem
• An Erdős-Ko-Rado theorem for the subcubes of a cube
• An Erdős--Ko--Rado theorem for partial permutations
• Erdős-Ko-Rado-type theorems for colored sets
• Multiple cross-intersecting families of signed sets
• Some Erdős-Ko-Rado theorems for injections
• On \(t\)-intersecting families of signed sets and permutations
• Homomorphisms of 3-chromatic graphs
• An analogue of the Erdoes-Ko-Rado theorem for the Hamming schemes H(n,q)
• The diametric theorem in Hamming spaces---optimal anticodes
• An Erdős-Ko-Rado theorem for signed sets
• Width and dual width of subsets in polynomial association schemes
• Nontrivial independent sets of bipartite graphs and cross-intersecting families
• Stable sets of maximal size in Kneser-type graphs
• Erdős-Ko-Rado from Kruskal-Katona
• An Erdős-Ko-Rado theorem for subset partitions
• 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
• Erdős–Ko–Rado Theorems: Algebraic Approaches
• A Group-Theoretic Setting for Some Intersecting Sperner Families
• Circular perfect graphs
• The Erdös-Ko-Rado Theorem for Integer Sequences
• Intersecting generalised permutations
• Intersection theorems for systems of finite sets
• Cross-Intersecting Families of Partial Permutations
• An Erd\H{o}s--Ko--Rado theorem for matchings in the complete graph
• Intersecting families of permutations
• Towards a Katona type proof for the \(2\)-intersecting Erdős-Ko-Rado theorem

This page was built for publication: The Katona cycle proof of the Erdős-Ko-Rado theorem and its possibilities