{
  "id": "2011.11064",
  "version": "v1",
  "published": "2020-11-22T17:17:13.000Z",
  "updated": "2020-11-22T17:17:13.000Z",
  "title": "Extremal numbers of cycles revisited",
  "authors": [
    "David Conlon"
  ],
  "comment": "3 pages, to appear in Amer. Math. Monthly",
  "categories": [
    "math.CO"
  ],
  "abstract": "We give a simple geometric interpretation of an algebraic construction of Wenger that yields $n$-vertex graphs with no cycle of length $4$, $6$ or $10$ and close to the maximum number of edges.",
  "revisions": [
    {
      "version": "v1",
      "updated": "2020-11-22T17:17:13.000Z"
    }
  ],
  "analyses": {
    "keywords": [
      "extremal numbers",
      "simple geometric interpretation",
      "algebraic construction",
      "vertex graphs",
      "maximum number"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 3,
      "language": "en",
      "license": "arXiv",
      "status": "editable"
    }
  }
}