A new proof of the Erdős-Ko-Rado theorem for intersecting families of permutations
Abstract
Description
Let S(n) be the symmetric group on n points. A subset S of S(n) is intersecting if for any pair of permutations π, σin S there is a point i in {1,...,n} such that π(i)=σ(i). Deza and Frankl \cite{MR0439648} proved that if S a subset of S(n) is intersecting then |S| \leq (n-1)!. Further, Cameron and Ku \cite{MR2009400} show that the only sets that meet this bound are the cosets of a stabilizer of a point. In this paper we give a very different proof of this same result.
18 pages. submitted to European Journal of Combinatorics
18 pages. submitted to European Journal of Combinatorics