For \math{p\ge 1}, we prove that every forest with \math{p} trees whose sizes
are a1β,...,apβ can be embedded in any graph containing at least
βi=1pβ(aiβ+1) vertices and having a minimum degree at least
βi=1pβaiβ.Comment: Working paper, submitte