Embedding a Forest in a Graph

  • Mark K. Goldberg
  • Malik Magdon-Ismail

Abstract

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

Published
2011-04-29
Article Number
P99