Sharp bounds for decomposing graphs into edges and triangles

DOI10.1017/S0963548320000358zbMath1466.05176arXiv1909.11371MaRDI QIDQ4993262

Adam Blumenthal, Jan Volec, Oleg Pikhurko, Florian Pfender, Yanitsa Pehova, Bernard Lidický

Publication date: 15 June 2021

Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1909.11371

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items

Maximizing five-cycles in \(K_r\)-free graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Integer and fractional packings in dense graphs
• Proof of a conjecture of Katona and Tarjan
• On the number of edge disjoint cliques in graphs of given size
• Fractional Triangle Decompositions in Graphs with Large Minimum Degree
• On the Minimal Density of Triangles in Graphs
• On a problem of G. O. H. Katona and T. Tarján
• On the Decomposition of Graphs
• Integer and fractional packing of families of graphs
• THE EXACT MINIMUM NUMBER OF TRIANGLES IN GRAPHS WITH GIVEN ORDER AND SIZE
• On the Minimum Degree Required for a Triangle Decomposition
• Decomposing Graphs into Edges and Triangles
• Asymptotic Structure of Graphs with the Minimum Number of Triangles
• Flag algebras
• The Representation of a Graph by Set Intersections
• Edge-decompositions of graphs with high minimum degree
• Efficient testing of large graphs
• On the number of edge-disjoint triangles in \(K_4\)-free graphs