{
  "id": "1908.06697",
  "version": "v1",
  "published": "2019-08-19T11:15:53.000Z",
  "updated": "2019-08-19T11:15:53.000Z",
  "title": "Counterexamples to Thomassen's conjecture on decomposition of cubic graphs",
  "authors": [
    "Thomas Bellitto",
    "Tereza Klimošová",
    "Martin Merker",
    "Marcin Witkowski",
    "Yelena Yuditsky"
  ],
  "categories": [
    "math.CO"
  ],
  "abstract": "We construct an infinite family of counterexamples to Thomassen's conjecture that the vertices of every 3-connected, cubic graph on at least 8 vertices can be colored blue and red such that the blue subgraph has maximum degree at most 1 and the red subgraph minimum degree at least 1 and contains no path on 4 vertices.",
  "revisions": [
    {
      "version": "v1",
      "updated": "2019-08-19T11:15:53.000Z"
    }
  ],
  "analyses": {
    "keywords": [
      "thomassens conjecture",
      "cubic graph",
      "counterexamples",
      "decomposition",
      "red subgraph minimum degree"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 0,
      "language": "en",
      "license": "arXiv",
      "status": "editable"
    }
  }
}