Paper Info
Title
On the number of edge-disjoint triangles in K4-free graphs
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.
Year
DOI
Venue
2017
10.1016/j.endm.2017.07.007
Electronic Notes in Discrete Mathematics
Keywords
DocType
Volume
graphs,complete graphs,triangles,edge disjoint cliques
Journal
61
ISSN
Citations 
PageRank 
1571-0653
0
0.34
References 
Authors
0
2
Name
Order
Citations
PageRank
Ervin Györi18821.62
Balázs Keszegh215624.36