Article ID Journal Published Year Pages File Type
5777121 Electronic Notes in Discrete Mathematics 2017 4 Pages PDF
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.
Keywords
Related Topics
Physical Sciences and Engineering Mathematics Discrete Mathematics and Combinatorics
Preview
On the number of edge-disjoint triangles in K4-free graphs
Authors
, ,