Embedding a Forest in a Graph

الأصل · EN

For p≥ 1, we prove that every forest with p trees whose sizes are a₁,..., aₚ can be embedded in any graph containing at least ∑ᵢ₌₁ᵖ (aᵢ + 1) vertices and having a minimum degree at least ∑ᵢ₌₁ᵖ aᵢ.