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

We prove that the maximum number of triangles in a C 5‐free graph on n vertices is at most 122(1+o(1))n3∕2, improving an estimate of Alon and Shikhelman.

Saved in:
Bibliographic Details
Published inJournal of graph theory Vol. 90; no. 3; pp. 227 - 230
Main Authors Ergemlidze, Beka, Methuku, Abhishek, Salia, Nika, Győri, Ervin
Format Journal Article
LanguageEnglish
Published Hoboken Wiley Subscription Services, Inc 01.03.2019
Subjects
Apexes
extremal graphs
Graph theory
graphs
triangles
Online AccessGet full text
ISSN0364-9024
1097-0118
DOI10.1002/jgt.22390

Cover

More Information
Summary:We prove that the maximum number of triangles in a C 5‐free graph on n vertices is at most 122(1+o(1))n3∕2, improving an estimate of Alon and Shikhelman.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:0364-9024
1097-0118
DOI:10.1002/jgt.22390