Embedding trees into graphs of large girth (Q1567289)
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 trees into graphs of large girth |
scientific article; zbMATH DE number 1455616
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Embedding trees into graphs of large girth |
scientific article; zbMATH DE number 1455616 |
Statements
Embedding trees into graphs of large girth (English)
0 references
30 March 2001
0 references
It is shown that for all except a finite number of pairs \((t,k)\) the following conjecture of Dobson holds: A tree \(T\) with \(k\) vertices can always be embedded into a graph of minimum degree \(\max\{\Delta(T), \lceil (k-1)/t \rceil \}\) and girth at least \(2t+1.\)
0 references
tree embeddings
0 references
graph girth
0 references
