On the number of edge-disjoint triangles in $K_4$-free graphs
Combinatorics
2015-06-11 v1
Abstract
We show the quarter of a century old conjecture that every -free graph with vertices and edges contains pairwise edge disjoint triangles.
Keywords
Cite
@article{arxiv.1506.03306,
title = {On the number of edge-disjoint triangles in $K_4$-free graphs},
author = {Ervin Győri and Balázs Keszegh},
journal= {arXiv preprint arXiv:1506.03306},
year = {2015}
}