A Proof of the Cameron-Ku conjecture
David Ellis

TL;DR
This paper proves the Cameron-Ku conjecture by establishing a stability result for intersecting permutation families and confirming a Hilton-Milner type bound for large n, using representation theory and extremal combinatorics.
Contribution
It proves the stability conjecture and the Hilton-Milner type conjecture for large n, advancing understanding of the structure of large intersecting permutation families.
Findings
Proved the stability conjecture for intersecting families.
Confirmed the Hilton-Milner type bound for large n.
Established an extremal bound for cross-intersecting permutation families.
Abstract
A family of permutations A \subset S_n is said to be intersecting if any two permutations in A agree at some point, i.e. for any \sigma, \pi \in A, there is some i such that \sigma(i)=\pi(i). Deza and Frankl showed that for such a family, |A| <= (n-1)!. Cameron and Ku showed that if equality holds then A = {\sigma \in S_{n}: \sigma(i)=j} for some i and j. They conjectured a `stability' version of this result, namely that there exists a constant c < 1 such that if A \subset S_{n} is an intersecting family of size at least c(n-1)!, then there exist i and j such that every permutation in A maps i to j (we call such a family `centred'). They also made the stronger `Hilton-Milner' type conjecture that for n \geq 6, if A \subset S_{n} is a non-centred intersecting family, then A cannot be larger than the family C = {\sigma \in S_{n}: \sigma(1)=1, \sigma(i)=i \textrm{for some} i > 2} \cup…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
