A new proof of the Erdős-Ko-Rado theorem for intersecting families of permutations
| dc.creator | Godsil, Chris | |
| dc.creator | Meagher, Karen | |
| dc.date | 2007-10-10 | |
| dc.date.accessioned | 2026-07-07T08:35:38Z | |
| dc.date.available | 2026-07-07T08:35:38Z | |
| dc.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. | |
| dc.description | 18 pages. submitted to European Journal of Combinatorics | |
| dc.identifier | https://arxiv.org/abs/0710.2109 | |
| dc.identifier | http://arxiv.org/abs/0710.2109 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/139806 | |
| dc.subject | Combinatorics | |
| dc.subject | 20B30; 05A05 | |
| dc.title | A new proof of the Erdős-Ko-Rado theorem for intersecting families of permutations | |
| dc.type | text |