REAL

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

Ergemlidze, Beka and Methuku, Abhishek and Salia, Nika and Győri, Ervin (2019) A note on the maximum number of triangles in a C5-free graph. JOURNAL OF GRAPH THEORY, 90 (3). pp. 227-230. ISSN 0364-9024

[img]
Preview
Text
170602830v1.pdf
Available under License Creative Commons Attribution.

Download (83kB) | Preview

Abstract

We prove that the maximum number of triangles in a C5-free graph on n vertices is at most 1/2√2(1+o(1))n3/2, improving an estimate of Alon and Shikhelman.

Item Type: Article
Subjects: Q Science / természettudomány > QA Mathematics / matematika > QA166-QA166.245 Graphs theory / gráfelmélet
SWORD Depositor: MTMT SWORD
Depositing User: MTMT SWORD
Date Deposited: 05 Sep 2019 07:42
Last Modified: 17 Apr 2023 13:38
URI: http://real.mtak.hu/id/eprint/98609

Actions (login required)

Edit Item Edit Item