A density Corrلdi-Hajnal theorem

For n sufficiently large, we determine the density threshold for an n-vertex graph to contain k vertex-disjoint triangles, where 0 ⩽ k ⩽ n 3 . This extends results by Erdős and by Moon, and can be viewed as a density version of the Corrádi-Hajnal theorem.