A new proof of the Erdős-Ko-Rado theorem for intersecting families of permutations

From MaRDI portal
(Redirected from Publication:1003591)




Abstract: Let S(n) be the symmetric group on n points. A subset S of S(n) is intersecting if for any pair of permutations pi, sigma in S there is a point i in {1,...,n} such that pi(i)=sigma(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.




Cited in
(63)


Describes a project that uses

Uses Software





This page was built for publication: A new proof of the Erdős-Ko-Rado theorem for intersecting families of permutations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1003591)