arXiv Analytics

Sign in

arXiv:1506.03306 [math.CO]AbstractReferencesReviewsResources

On the number of edge-disjoint triangles in $K_4$-free graphs

Ervin Győri, Balázs Keszegh

Published 2015-06-10Version 1

We show the quarter of a century old conjecture that every $K_4$-free graph with $n$ vertices and $\lfloor n^2/4 \rfloor +k$ edges contains $k$ pairwise edge disjoint triangles.

Related articles: Most relevant | Search more
arXiv:1608.04675 [math.CO] (Published 2016-08-16)
A Stability Theorem for Maximal $K_{r+1}$-free Graphs
arXiv:2011.11427 [math.CO] (Published 2020-11-23)
A Stability Theorem for Maximal $C_{2k+1}$-free Graphs
arXiv:1304.1680 [math.CO] (Published 2013-04-05, updated 2013-05-14)
Degree powers in $C_5$-free graphs