Embedding a forest in a graph

Abstract: For math{pge 1}, we prove that every forest with math{p} trees whose sizes are

a_{1}, ..., a_{p}

can be embedded in any graph containing at least

s u m_{i = 1}^{p} (a_{i} + 1)

vertices and having a minimum degree at least

s u m_{i = 1}^{p} a_{i}

.

Full work available at URL: https://arxiv.org/abs/1011.3882

File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

Recommendations

Cited In (4)

This page was built for publication: Embedding a forest in a graph