Sharp bounds for decomposing graphs into edges and triangles
From MaRDI portal
Publication:4993262
DOI10.1017/S0963548320000358zbMath1466.05176arXiv1909.11371MaRDI QIDQ4993262
Oleg Pikhurko, Florian Pfender, Jan Volec, Bernard Lidický, Adam Blumenthal, Yanitsa Pehova
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
05C35: Extremal problems in graph theory
05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)
