An improved error term for minimum \(H\)-decompositions of graphs
From MaRDI portal
Publication:740649
DOI10.1016/j.jctb.2014.03.001zbMath1297.05184arXiv1109.2571MaRDI QIDQ740649
Publication date: 4 September 2014
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1109.2571
05C35: Extremal problems in graph theory
05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)