| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 5777099 | Electronic Notes in Discrete Mathematics | 2017 | 4 Pages |
Abstract
We prove that the maximum number of triangles in a C5-free graph on n vertices is at most 122(1+o(1))n3/2, improving an estimate of Alon and Shikhelman [Alon, N. and C. Shikhelman, Many T copies in H-free graphs. Journal of Combinatorial Theory, Series B 121 (2016) 146-172].
Keywords
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Beka Ergemlidze, Ervin GyÅri, Abhishek Methuku, Nika Salia,