{
  "id": "1503.06912",
  "version": "v1",
  "published": "2015-03-24T04:52:03.000Z",
  "updated": "2015-03-24T04:52:03.000Z",
  "title": "Hadwiger's conjecture for the complements of Kneser graphs",
  "authors": [
    "Guangjun Xu",
    "Sanming Zhou"
  ],
  "categories": [
    "math.CO"
  ],
  "abstract": "Hadwiger's conjecture asserts that every graph with chromatic number $t$ contains a complete minor of order $t$. Given integers $n \\ge 2k+1 \\ge 5$, the Kneser graph $K(n, k)$ is the graph with vertices the $k$-subsets of an $n$-set such that two vertices are adjacent if and only if the corresponding $k$-subsets are disjoint. We prove that Hadwiger's conjecture is true for the complements of Kneser graphs.",
  "revisions": [
    {
      "version": "v1",
      "updated": "2015-03-24T04:52:03.000Z"
    }
  ],
  "analyses": {
    "subjects": [
      "05C15",
      "05C83"
    ],
    "keywords": [
      "kneser graph",
      "complements",
      "hadwigers conjecture asserts",
      "chromatic number",
      "complete minor"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 0,
      "language": "en",
      "license": "arXiv",
      "status": "editable",
      "adsabs": "2015arXiv150306912X"
    }
  }
}