REAL

On the number of edge-disjoint triangles in K4-free graphs

Győri, Ervin and Keszegh, Balázs (2017) On the number of edge-disjoint triangles in K4-free graphs. ELECTRONIC NOTES IN DISCRETE MATHEMATICS, 61. pp. 557-560. ISSN 1571-0653

[img]
Preview
Text
1506.03306v1.pdf

Download (177kB) | Preview

Abstract

We prove the quarter of a century old conjecture of Erdős that every K4-free graph with n vertices and ⌊n2/4⌋+m edges contains m pairwise edge disjoint triangles. © 2017 Elsevier B.V.

Item Type: Article
Uncontrolled Keywords: TRIANGLES; GRAPHS; edge disjoint cliques; Complete graphs
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: 13 Dec 2017 15:07
Last Modified: 13 Dec 2017 15:07
URI: http://real.mtak.hu/id/eprint/71050

Actions (login required)

View Item View Item