{
  "id": "1706.02830",
  "version": "v1",
  "published": "2017-06-09T04:12:43.000Z",
  "updated": "2017-06-09T04:12:43.000Z",
  "title": "A note on the maximum number of triangles in a $C_5$-free graph",
  "authors": [
    "Beka Ergemlidze",
    "Ervin Győri",
    "Abhishek Methuku",
    "Nika Salia"
  ],
  "categories": [
    "math.CO"
  ],
  "abstract": "We prove that the maximum number of triangles in a $C_5$-free graph on $n$ vertices is at most $\\frac{1}{2 \\sqrt 2} (1 + o(1)) n^{3/2}$, improving an estimate of Alon and Shikhelman.",
  "revisions": [
    {
      "version": "v1",
      "updated": "2017-06-09T04:12:43.000Z"
    }
  ],
  "analyses": {
    "keywords": [
      "free graph",
      "maximum number",
      "shikhelman"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 0,
      "language": "en",
      "license": "arXiv",
      "status": "editable"
    }
  }
}