Turan's theorem tells us that if m is the number of edges in a graph with n vertices and clique number r, then 2m <= (r - 1)n^2/r.

If t denotes the number of triangles, is there a similar upper bound for t, using r and n and/or m for r >= 3? Many thanks.