MathNet 2010 — Part 04 Question 61

Let $G$ be a graph, not containing $K_4$ as a subgraph and $|V(G)| = 3k$. What is the maximum number of triangles in $G$.