Embedding trees into graphs of large girth
type: Item
instance of: scholarly article
title: Embedding trees into graphs of large girth
zbMATH Open document ID: 0958.05030
DOI: 10.1016/S0012-365X(99)00354-4
published in: Discrete Mathematics
publication date: 2001-03-30T00:00:00Z
review text: 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.\)
reviewed by: Peter Kirschenhofer
Mathematics Subject Classification ID: 05C10
Mathematics Subject Classification ID: 05C05
zbMATH DE Number: 1455616
zbMATH Keywords: tree embeddings
zbMATH Keywords: graph girth
author: Penny Haxell
author: Tomasz Łuczak
MaRDI profile type: Publication
full work available at URL: s0012-365x(99)00354-4
OpenAlex ID: W2066380283
Wikidata QID: Q127740025
description: scientific article; zbMATH DE number 1455616