  We consider the problem of minimising the number of edges that are contained
in triangles, among $n$-vertex graphs with a given number of edges. We prove a
conjecture of F\"uredi and Maleki that gives an exact formula for this minimum,
for sufficiently large $n$.
