Erdős's monochromatic triangle packing conjecture

Let $K_n$ be the complete graph on $n$ vertices whose edges are coloured with two colours. A collection of triangles is pairwise edge-disjoint if no edge belongs to more than one triangle. Erdős's conjecture. Every $2$-coloured $K_n$ contains $n^2/12 + o(n^2)$ pairwise edge-disjoint monochromatic triangles. This conjecture asks for the asymptotically sharp guaranteed size of a monochromatic triangle packing in every two-edge-colouring of a complete graph; the paper's abstract says that it confirms the conjecture.