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

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

2007-10-10

arxiv.org/abs/0710.2109v1

Mathematics

Combinatorics

18 pages. submitted to European Journal of Combinatorics

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

A new proof of the Erdős-Ko-Rado theorem for intersecting families of permutations does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with A new proof of the Erdős-Ko-Rado theorem for intersecting families of permutations, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A new proof of the Erdős-Ko-Rado theorem for intersecting families of permutations will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-541050