Embedding a forest in a graph (Q540102)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Embedding a forest in a graph |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Embedding a forest in a graph |
scientific article |
Statements
Embedding a forest in a graph (English)
0 references
1 June 2011
0 references
Summary: For \(p \geq 1\), we prove that every forest with \(p\) trees whose sizes are \(a_1,\dots, a_p\) can be embedded in any graph containing at least \(\sum^p_{i=1} (a_i + 1)\) vertices and having minimum degree at least \(\sum^p_{i=1} a_i\).
0 references
0.8086674213409424
0 references
0.8081883192062378
0 references
0.797468900680542
0 references
0.7936875224113464
0 references
0.7871119379997253
0 references
