On the number of edge-disjoint triangles in \(K_4\)-free graphs (Q5970289)
From MaRDI portal
scientific article; zbMATH DE number 6851242
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the number of edge-disjoint triangles in \(K_4\)-free graphs |
scientific article; zbMATH DE number 6851242 |
Statements
On the number of edge-disjoint triangles in \(K_4\)-free graphs (English)
0 references
16 March 2018
0 references
The authors prove that every \(K_4\)-free graph with \(n\) vertices and \(\lfloor n^2/4 \rfloor + m\) edges contains at least \(m\) edge-disjoint triangles. The result is best possible.
0 references
edge-disjoint triangles
0 references
