{
  "id": "1407.0626",
  "version": "v2",
  "published": "2014-07-02T16:03:26.000Z",
  "updated": "2015-08-07T20:52:44.000Z",
  "title": "A list analog of Vizing's Theorem for simple graphs with triangles but no other odd cycles",
  "authors": [
    "Jessica McDonald"
  ],
  "comment": "This paper has been withdrawn by the author",
  "categories": [
    "math.CO"
  ],
  "abstract": "This paper has been withdrawn by the author. Peterson and Woodall previously proved that the list-edge-colouring conjecture holds for graphs without odd cycles of length 5 or longer. D. Peterson and D. R. Woodall, Edge-choosability in line-perfect multigraphs, Discrete Mathematics 202 (1999), 191-199. D. Peterson and D. R. Woodall, Erratum to \"Edge-choosability in line-perfect multigraphs\", Discrete Mathematics 260 (2003), 323-326.",
  "revisions": [
    {
      "version": "v1",
      "updated": "2014-07-02T16:03:26.000Z",
      "abstract": "We prove that if G is a simple graph with no odd cycles of length 5 or longer, then G is $(\\Delta+1)$-list-edge-colourable, where $\\Delta$ is the maximum degree of G. Our method involves manipulating Galvin's proof that the list-edge-colouring conjecture holds for bipartite graphs.",
      "comment": null,
      "journal": null,
      "doi": null
    },
    {
      "version": "v2",
      "updated": "2015-08-07T20:52:44.000Z"
    }
  ],
  "analyses": {
    "keywords": [
      "odd cycles",
      "simple graph",
      "list analog",
      "vizings theorem",
      "list-edge-colouring conjecture holds"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 0,
      "language": "en",
      "license": "arXiv",
      "status": "editable",
      "adsabs": "2014arXiv1407.0626M"
    }
  }
}