{
  "id": "1506.03306",
  "version": "v1",
  "published": "2015-06-10T13:51:45.000Z",
  "updated": "2015-06-10T13:51:45.000Z",
  "title": "On the number of edge-disjoint triangles in $K_4$-free graphs",
  "authors": [
    "Ervin Győri",
    "Balázs Keszegh"
  ],
  "categories": [
    "math.CO"
  ],
  "abstract": "We show the quarter of a century old conjecture that every $K_4$-free graph with $n$ vertices and $\\lfloor n^2/4 \\rfloor +k$ edges contains $k$ pairwise edge disjoint triangles.",
  "revisions": [
    {
      "version": "v1",
      "updated": "2015-06-10T13:51:45.000Z"
    }
  ],
  "analyses": {
    "keywords": [
      "free graph",
      "edge-disjoint triangles",
      "pairwise edge disjoint triangles",
      "century old conjecture",
      "edges contains"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 0,
      "language": "en",
      "license": "arXiv",
      "status": "editable",
      "adsabs": "2015arXiv150603306G"
    }
  }
}