SOLVED
Every graph with $n$ vertices and $>n^2/4$ edges contains an edge which is in at least $n/6$ triangles.
A conjecture of Bollobás and Erdős. This was proved independently by Edwards (unpublished) and Hadziivanov and Nikiforov
[KhNi79].
For a more general problem see [80].
