Optimal packings of bounded degree trees

DOI10.4171/JEMS/909zbMath1429.05164arXiv1606.03953MaRDI QIDQ2279501

Felix Joos, Daniela Kühn, Deryk Osthus, Jae-Hoon Kim

Publication date: 12 December 2019

Published in: Journal of the European Mathematical Society (JEMS) (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1606.03953

zbMATH Keywords

packings; trees; graph decompositions; quasirandomness

Mathematics Subject Classification ID

05C05: Trees

05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)

05D40: Probabilistic methods in extremal combinatorics, including polynomial methods (combinatorial Nullstellensatz, etc.)