{
  "id": "1905.02167",
  "version": "v1",
  "published": "2019-05-06T17:36:07.000Z",
  "updated": "2019-05-06T17:36:07.000Z",
  "title": "Counterexamples to Hedetniemi's conjecture",
  "authors": [
    "Yaroslav Shitov"
  ],
  "comment": "3 pages",
  "categories": [
    "math.CO"
  ],
  "abstract": "The chromatic number of $G\\times H$ can be smaller than the minimum of the chromatic numbers of finite simple graphs $G$ and $H$.",
  "revisions": [
    {
      "version": "v1",
      "updated": "2019-05-06T17:36:07.000Z"
    }
  ],
  "analyses": {
    "keywords": [
      "hedetniemis conjecture",
      "counterexamples",
      "chromatic number"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 3,
      "language": "en",
      "license": "arXiv",
      "status": "editable"
    }
  }
}