1. Department of Mathematics, Central European University, Budapest, Hungary;2. Rényi Institute, Hungarian Academy of Sciences and Department of Mathematics, Central European University, Budapest, Hungary
Abstract:
We prove that the maximum number of triangles in a -free graph on vertices is at most , improving an estimate of Alon and Shikhelman.