Abstract: | We introduce a new approach and prove that the maximum number of triangles in a -free graph on vertices is at most We show a connection to -uniform hypergraphs without (Berge) cycles of length less than six, and estimate their maximum possible size. Using our approach, we also (slightly) improve the previous estimate on the maximum size of an induced--free and -free graph. |