{
  "id": "1603.02960",
  "version": "v1",
  "published": "2016-03-09T16:49:36.000Z",
  "updated": "2016-03-09T16:49:36.000Z",
  "title": "Maximising the number of induced cycles in a graph",
  "authors": [
    "Natasha Morrison",
    "Alex Scott"
  ],
  "comment": "33 pages",
  "categories": [
    "math.CO"
  ],
  "abstract": "We determine the maximum number of induced cycles that can be contained in a graph on $n\\ge n_0$ vertices. We characterise the $n$-vertex graphs that contain this maximum number of cycles, showing that they are unique up to isomorphism. We also determine the maximum number of odd or even cycles that can be contained in a graph on $n\\ge n_0$ vertices and characterise the extremal graphs.",
  "revisions": [
    {
      "version": "v1",
      "updated": "2016-03-09T16:49:36.000Z"
    }
  ],
  "analyses": {
    "keywords": [
      "induced cycles",
      "maximum number",
      "characterise",
      "maximising"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 33,
      "language": "en",
      "license": "arXiv",
      "status": "editable",
      "adsabs": "2016arXiv160302960M"
    }
  }
}