Theorem 4.4. Assuming that:

$G$ a graph with $m$ edges

Then

G

has at most

\frac{{(2 m)}^{\frac{3}{2}}}{6}

triangles.