{
  "id": "1904.12273",
  "version": "v1",
  "published": "2019-04-28T07:58:02.000Z",
  "updated": "2019-04-28T07:58:02.000Z",
  "title": "Detecting a long odd hole",
  "authors": [
    "Maria Chudnovsky",
    "Alex Scott",
    "Paul Seymour"
  ],
  "categories": [
    "math.CO"
  ],
  "abstract": "For each integer $t\\ge 5$, we give a polynomial-time algorithm to test whether a graph contains an induced cycle with length at least $t$ and odd.",
  "revisions": [
    {
      "version": "v1",
      "updated": "2019-04-28T07:58:02.000Z"
    }
  ],
  "analyses": {
    "keywords": [
      "long odd hole",
      "polynomial-time algorithm",
      "graph contains",
      "induced cycle"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 0,
      "language": "en",
      "license": "arXiv",
      "status": "editable"
    }
  }
}