On the number of edge-disjoint triangles in K4-free graphs

We prove the quarter of a century old conjecture of Erdős that every K4-free graph with n vertices and ⌊n2/4⌋+m edges contains m pairwise edge disjoint triangles.