The number of triangles in a \(K_ 4\)-free graph
The author shows that if a graph with e edges contains no complete 4- graphs then it contains at most \((e/3)^{3/2}\) complete 3-graphs.
scientific article; zbMATH DE number 4077262