TREE DECOMPOSITION OF GRAPHS

Authors
YUSTER R
Citation
R. Yuster, TREE DECOMPOSITION OF GRAPHS, Random structures & algorithms, 12(3), 1998, pp. 237-251
Citations number
8
Categorie Soggetti
Mathematics,Mathematics,"Computer Science Software Graphycs Programming",Mathematics,Mathematics,"Computer Science Software Graphycs Programming
Journal title
Random structures & algorithms → ACNP
ISSN journal
10429832
Volume
12
Issue
3
Year of publication
1998
Pages
237 - 251
Database
ISI
SICI code
1042-9832(1998)12:3<237:>2.0.ZU;2-W
Abstract
Let H be a tree on h greater than or equal to 2 vertices. It is shown that if G = (V,E) is a graph with delta(G) greater than or equal to (\ V\/2) + 10h(4) root\V\log\V\, and h - 1 divides \E\, then there is a d ecomposition of the edges of G into copies of H. This result is asympt otically the best possible for all trees with at least three vertices. (C) 1998 John Wiley & Sons, Inc.