Sharp bounds for decomposing graphs into edges and triangles

MaRDI QIDQ6621162zbMATH OpenFDO

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

Publication date 18 October 2024

Published in Acta Mathematica Universitatis Comenianae. New Series (Search for Journal in Brave)

Mathematics Subject Classification ID

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

Recommendations

• Sharp bounds for decomposing graphs into edges and triangles
• Decomposing graphs into edges and triangles
• On the minimum degree required for a triangle decomposition
• Publication:3487416
• Degree sum for a triangle in a graph

Cites work

• scientific article; zbMATH DE number 426361 (Why is no real title available?)
• scientific article; zbMATH DE number 4158653 (Why is no real title available?)
• scientific article; zbMATH DE number 4196017 (Why is no real title available?)
• A new lower bound based on Gromov's method of selecting heavily covered points
• A note on the inducibility of 4-vertex graphs
• A problem of Erdős on the minimum number of \(k\)-cliques
• Decomposing graphs into edges and triangles
• Edge-decompositions of graphs with high minimum degree
• Flag algebras
• Fractional triangle decompositions in graphs with large minimum degree
• Hypergraphs do jump
• Maximum density of induced 5-cycle is achieved by an iterated blow-up of 5-cycle
• On a problem of G. O. H. Katona and T. Tarján
• On the Decomposition of Graphs
• Proof of a conjecture of Katona and Tarjan
• The Representation of a Graph by Set Intersections

This page was built for publication: Sharp bounds for decomposing graphs into edges and triangles

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6621162)