Embedding a Forest in a Graph

Abstract

For \math{p\ge 1}, we prove that every forest with \math{p} trees whose sizes are $a_1,...,a_p$ can be embedded in any graph containing at least ${\sum }_{i=1}^p(a_i+1)$ vertices and having a minimum degree at least ${\sum }_{i=1}^p{a}_i$.

Working paper, submitted