{
  "id": "0710.2109",
  "version": "v1",
  "published": "2007-10-10T20:37:59.000Z",
  "updated": "2007-10-10T20:37:59.000Z",
  "title": "A new proof of the Erdős-Ko-Rado theorem for intersecting families of permutations",
  "authors": [
    "Chris Godsil",
    "Karen Meagher"
  ],
  "comment": "18 pages. submitted to European Journal of Combinatorics",
  "categories": [
    "math.CO"
  ],
  "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.",
  "revisions": [
    {
      "version": "v1",
      "updated": "2007-10-10T20:37:59.000Z"
    }
  ],
  "analyses": {
    "subjects": [
      "20B30",
      "05A05"
    ],
    "keywords": [
      "erdős-ko-rado theorem",
      "intersecting families",
      "permutations",
      "symmetric group",
      "stabilizer"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 18,
      "language": "en",
      "license": "arXiv",
      "status": "editable",
      "adsabs": "2007arXiv0710.2109G"
    }
  }
}