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

Abhishek Methuku; Beka Ergemlidze; Ervin Gy\H{o}ri; Nika Salia

arxiv: 1706.02830 · v1 · pith:QODHCFNQnew · submitted 2017-06-09 · 🧮 math.CO

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

Beka Ergemlidze , Ervin Gy\H{o}ri , Abhishek Methuku , Nika Salia This is my paper

classification 🧮 math.CO

keywords freegraphmaximumnumbertrianglesalonestimatefrac

0 comments

read the original 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.

This paper has not been read by Pith yet.

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

discussion (0)