# Optimal packings of bounded degree trees

@article{Joos2019OptimalPO,
title={Optimal packings of bounded degree trees},
author={Felix Joos and Jaehoon Kim and Daniel Kuhn and Deryk Osthus},
journal={Journal of the European Mathematical Society},
year={2019}
}
• Published 13 June 2016
• Mathematics
• Journal of the European Mathematical Society
We prove that if $T_1,\dots, T_n$ is a sequence of bounded degree trees so that $T_i$ has $i$ vertices, then $K_n$ has a decomposition into $T_1,\dots, T_n$. This shows that the tree packing conjecture of Gyarfas and Lehel from 1976 holds for all bounded degree trees (in fact, we can allow the first $o(n)$ trees to have arbitrary degrees). Similarly, we show that Ringel's conjecture from 1963 holds for all bounded degree trees. We deduce these results from a more general theorem, which yields…

### Packing trees of unbounded degrees in random graphs

• Computer Science, Mathematics
J. Lond. Math. Soc.
• 2019
This paper proves that with high probability, one can find edge‐disjoint copies of all the Ti in the random graph Gn,p, provided that p⩾(logn)36/n and N⩽(1−ε)np/2 for a positive constant ε .

### Tree decompositions of graphs without large bipartite holes

• Mathematics
Random Struct. Algorithms
• 2020

### Packing Trees into the Complete Graph

• Edward Dobson
• Mathematics
Combinatorics, Probability and Computing
• 2002
If T is a tree of order n+1−c′n, c′ [les ] 1/25 (37−8 √21 ) ≈ 0.0135748, such that there exists a vertex x ∈ V(T) and T−x has at least n(1−2c′) isolated vertices, then 2n+1 copies of T may be packed into K2n-1.