On the number of edge-disjoint triangles in \(K_4\)-free graphs

DOI10.1007/s00493-016-3500-0zbMath1399.05123OpenAlexW2752902989MaRDI QIDQ5970289

Ervin Győry, Balázs Keszegh

Publication date: 16 March 2018

Published in: Combinatorica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00493-016-3500-0

zbMATH Keywords

edge-disjoint triangles

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35)

Related Items (4)

On graphs that contain exactly \(k\) copies of a subgraph, and a related problem in search theory ⋮ Two Conjectures in Ramsey--Turán Theory ⋮ Saturation problems in the Ramsey theory of graphs, posets and point sets ⋮ Sharp bounds for decomposing graphs into edges and triangles

Cites Work

• On the number of edge disjoint cliques in graphs of given size
• Packing triangles in \(K_4\)-free graphs
• Dependence polynomials
• On the Minimal Density of Triangles in Graphs
• Lower bounds on the number of triangles in a graph
• On a problem of G. O. H. Katona and T. Tarján
• On the Decomposition of Graphs

This page was built for publication: On the number of edge-disjoint triangles in \(K_4\)-free graphs