{
  "id": "2110.09970",
  "version": "v2",
  "published": "2021-10-19T13:35:11.000Z",
  "updated": "2023-05-24T11:37:56.000Z",
  "title": "Graphs with all holes the same length",
  "authors": [
    "Linda Cook",
    "Jake Horsfield",
    "Myriam Preissmann",
    "Cléophée Robin",
    "Paul Seymour",
    "Ni Luh Dewi Sintiari",
    "Nicolas Trotignon",
    "Kristina Vušković"
  ],
  "categories": [
    "math.CO"
  ],
  "abstract": "A graph is \"$\\ell$-holed\" if all its induced cycles of length at least four have length exactly $\\ell$. We give a complete description of the $\\ell$-holed graphs for each $\\ell\\ge 7$.",
  "revisions": [
    {
      "version": "v2",
      "updated": "2023-05-24T11:37:56.000Z"
    }
  ],
  "analyses": {
    "subjects": [
      "05C75"
    ],
    "keywords": [
      "complete description",
      "induced cycles"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 0,
      "language": "en",
      "license": "arXiv",
      "status": "editable"
    }
  }
}