{
  "id": "2009.05691",
  "version": "v1",
  "published": "2020-09-12T00:40:42.000Z",
  "updated": "2020-09-12T00:40:42.000Z",
  "title": "Detecting a long even hole",
  "authors": [
    "Linda Cook",
    "Paul Seymour"
  ],
  "comment": "34 pages",
  "categories": [
    "math.CO"
  ],
  "abstract": "For each integer $\\ell \\geq 4$, we give a polynomial-time algorithm to test whether a graph contains an induced cycle with length at least $\\ell$ and even",
  "revisions": [
    {
      "version": "v1",
      "updated": "2020-09-12T00:40:42.000Z"
    }
  ],
  "analyses": {
    "keywords": [
      "polynomial-time algorithm",
      "graph contains",
      "induced cycle"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 34,
      "language": "en",
      "license": "arXiv",
      "status": "editable"
    }
  }
}