Sharp bounds for decomposing graphs into edges and triangles
From MaRDI portal
Publication:6621162
Jan Volec, Adam Blumenthal, Florian Pfender, Oleg Pikhurko, Bernard Lidický, Yanitsa Pehova
Publication date: 18 October 2024
Published in: Acta Mathematica Universitatis Comenianae. New Series (Search for Journal in Brave)
Extremal problems in graph theory (05C35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A problem of Erdős and Sós on 3-graphs
- 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
- Maximum density of induced 5-cycle is achieved by an iterated blow-up of 5-cycle
- Proof of a conjecture of Katona and Tarjan
- Hypergraphs Do Jump
- Fractional Triangle Decompositions in Graphs with Large Minimum Degree
- On a problem of G. O. H. Katona and T. Tarján
- On the Decomposition of Graphs
- Decomposing Graphs into Edges and Triangles
- Flag algebras
- The Representation of a Graph by Set Intersections
- Counting flags in triangle-free digraphs
- Edge-decompositions of graphs with high minimum degree
This page was built for publication: Sharp bounds for decomposing graphs into edges and triangles
