Embedding a forest in a graph (Q540102)

Summary: For \(p \geq 1\), we prove that every forest with \(p\) trees whose sizes are \(a_1,\dots, a_p\) can be embedded in any graph containing at least \(\sum^p_{i=1} (a_i + 1)\) vertices and having minimum degree at least \(\sum^p_{i=1} a_i\).