Embedding a Forest in a Graph


For p ≥ 1, we prove that every forest with p trees whose sizes are a1, . . . , ap can be embedded in any graph containing at least ∑p i=1(ai + 1) vertices and having a minimum degree at least ∑p i=1 ai. 

Figures and Tables

Sorry, we couldn't extract any figures or tables for this paper.