Back to Search
Start Over
A note on the maximum number of triangles in a C5-free graph.
- Source :
- Electronic Notes in Discrete Mathematics; Aug2017, Vol. 61, p395-398, 4p
- Publication Year :
- 2017
-
Abstract
- We prove that the maximum number of triangles in a C 5 -free graph on n vertices is at most 1 2 2 ( 1 + o ( 1 ) ) n 3 / 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]. [ABSTRACT FROM AUTHOR]
Details
- Language :
- English
- ISSN :
- 15710653
- Volume :
- 61
- Database :
- Supplemental Index
- Journal :
- Electronic Notes in Discrete Mathematics
- Publication Type :
- Academic Journal
- Accession number :
- 124473112
- Full Text :
- https://doi.org/10.1016/j.endm.2017.06.065