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

Abstract

We prove that the maximum number of triangles in a C5-free graph on n vertices is at most 1 2 √ 2 (1 + o(1))n3/2, improving an estimate of Alon and Shikhelman [1]. 
DOI: 10.1016/j.endm.2017.06.065

1 Figure or Table