Sharp bounds for decomposing graphs into edges and triangles

MaRDI QIDQ6621162FDOQ6621162

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)

Cites Work

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

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)