A note on the maximum number of triangles in a $C_5$-free graph

Abstract

We prove that the maximum number of triangles in a $C_5$-free graph on $n$ vertices is at most $\frac{1}{2\sqrt{2}}(1+o(1))n^{3/2}$, improving an estimate of Alon and Shikhelman.