Embedding a Forest in a Graph

Mark K. Goldberg, Malik Magdon-Ismail
2011 Electronic Journal of Combinatorics  
For $p\ge 1$, we prove that every forest with $p$ trees whose sizes are $a_1, \ldots, a_p$ can be embedded in any graph containing at least $\sum_{i=1}^p (a_i + 1)$ vertices and having minimum degree at least $\sum_{i=1}^p a_i$.
doi:10.37236/586 fatcat:gosb3du2lfacrj5wepmc2jt4lu