On a problem of Erdős and Rothschild on edges in triangles (Q2448958)

Let \(h(n,c)\) denote the maximum number such that every graph \(G\) with \(n\) vertices and at least \(cn^2\) edges, each of which is in a triangle, will contain an edge on at least \(h(n, c)\) triangles. It was conjectured by Erdős that for each \(c > 0\) there is an \(\epsilon > 0\) such that \(h(n, c) > n^\epsilon\). The conjecture of Erdős was disproved by the following result. The existence of a \(G\) graph of order \(n\) sufficiently large with \(\frac{n^2}{4}(1 - e^{-(\log n)^{1/6}})\) edges with the property that every edge is in a triangle, but no edge is in more than \(n^{14/\log \log n}\) triangles was proved.