On the number of edge-disjoint triangles in $K_4$-free graphs

Ervin Győri, Balázs Keszegh

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.