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 minimum degree at least p i=1 ai.

• Type: Journal
• Year: 2010
• Where: CORR
• Authors: Mark K. Goldberg, Malik Magdon-Ismail
• Keywords: CORR 2010, Education, Minimum Degree