{
  "id": "0808.0774",
  "version": "v2",
  "published": "2008-08-06T15:17:40.000Z",
  "updated": "2008-08-08T18:09:37.000Z",
  "title": "Elementary Techniques for Erdos-Ko-Rado-like Theorems",
  "authors": [
    "Greg Brockman",
    "Bill Kay"
  ],
  "comment": "10 pages, 0 figures",
  "categories": [
    "math.CO"
  ],
  "abstract": "The well-known Erdos-Ko-Rado Theorem states that if F is a family of k-element subsets of {1,2,...,n} (n>2k-1) such that every pair of elements in F has a nonempty intersection, then |F| is at most $\\binom{n-1}{k-1}$. The theorem also provides necessary and sufficient conditions for attaining the maximum. We present elementary methods for deriving generalizations of the Erdos-Ko-Rado Theorem on several classes of combinatorial objects. We also extend our results to systems under Hamming intersection.",
  "revisions": [
    {
      "version": "v2",
      "updated": "2008-08-08T18:09:37.000Z"
    }
  ],
  "analyses": {
    "subjects": [
      "05D05"
    ],
    "keywords": [
      "elementary techniques",
      "erdos-ko-rado-like theorems",
      "well-known erdos-ko-rado theorem states",
      "k-element subsets",
      "nonempty intersection"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 10,
      "language": "en",
      "license": "arXiv",
      "status": "editable",
      "adsabs": "2008arXiv0808.0774B"
    }
  }
}