Jacobson's same-colour monochromatic triangle packing conjecture

Let $K_n$ be the complete graph on $n$ vertices with its edges coloured red and blue. A collection of triangles is pairwise edge-disjoint if no edge occurs in more than one triangle. Jacobson's conjecture. Every $2$-colouring of $K_n$ contains a collection of $n^2/20 + O(n^2)$ pairwise edge-disjoint monochromatic triangles, all of the same colour. The conjecture is asymptotically tight according to the balanced pentagon blow-up example described in the source; its resolution status is not given.