On the number of edge-disjoint triangles in K₄-free graphs
classification
🧮 math.CO
keywords
freetrianglescenturyconjecturecontainsdisjointedgeedge-disjoint
read the original abstract
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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.