Hi guys,
How to prove that a graph with n nodes and m edges has at least m*(4*m - n^{2})/(3*n) triangles?
Thanks in advance! ^-^
This is just a guess, but find the maximum number of edges that can fit with zero triangles. (Try to make as many squares as possible). At first, just look for patterns. Then try to relate the number of vertices with the number of edges.