Beka Ergemlidze, Ervin Győri, Abhishek Methuku, Nika Salia
Published 2017-06-09Version 1
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.
The maximum number of $P_\ell$ copies in $P_k$-free graphs
Triangles in $C_5$-free graphs and Hypergraphs of Girth Six
The maximum number of cliques in graphs without large matchings
![QR code for arXiv:1706.02830 [math.CO]](http://oss.arxitics.com/images/favicon.svg)