Tree Decomposition of Graphs

Raphael Yuster

doi:10.1002/(SICI)1098-2418(199805)12:3<237::AID-RSA2>3.0.CO;2-W

Tree Decomposition of Graphs

Raphael Yuster

Department of Mathematics

Research output: Contribution to journal › Article › peer-review

Abstract

Let H be a tree on h ≥ 2 vertices. It is shown that if G = (V, E) is a graph with δ(G) ≥ (|V|/2) + 10h⁴√|V|log|V|, and h - 1 divides |E|, then there is a decomposition of the edges of G into copies of H. This result is asymptotically the best possible for all trees with at least three vertices.

Original language	English
Pages (from-to)	237-251
Number of pages	15
Journal	Random Structures and Algorithms
Volume	12
Issue number	3
DOIs	https://doi.org/10.1002/(SICI)1098-2418(199805)12:3<237::AID-RSA2>3.0.CO;2-W
State	Published - May 1998

Keywords

Decomposition
Trees

ASJC Scopus subject areas

Software
General Mathematics
Computer Graphics and Computer-Aided Design
Applied Mathematics

Access to Document

10.1002/(SICI)1098-2418(199805)12:3<237::AID-RSA2>3.0.CO;2-W

Cite this

@article{c163db3593a746fca305f2f69871f664,

title = "Tree Decomposition of Graphs",

abstract = "Let H be a tree on h ≥ 2 vertices. It is shown that if G = (V, E) is a graph with δ(G) ≥ (|V|/2) + 10h4√|V|log|V|, and h - 1 divides |E|, then there is a decomposition of the edges of G into copies of H. This result is asymptotically the best possible for all trees with at least three vertices.",

keywords = "Decomposition, Trees",

author = "Raphael Yuster",

year = "1998",

month = may,

doi = "10.1002/(SICI)1098-2418(199805)12:3<237::AID-RSA2>3.0.CO;2-W",

language = "English",

volume = "12",

pages = "237--251",

journal = "Random Structures and Algorithms",

issn = "1042-9832",

publisher = "John Wiley and Sons Ltd",

number = "3",

}

TY - JOUR

T1 - Tree Decomposition of Graphs

AU - Yuster, Raphael

PY - 1998/5

Y1 - 1998/5

N2 - Let H be a tree on h ≥ 2 vertices. It is shown that if G = (V, E) is a graph with δ(G) ≥ (|V|/2) + 10h4√|V|log|V|, and h - 1 divides |E|, then there is a decomposition of the edges of G into copies of H. This result is asymptotically the best possible for all trees with at least three vertices.

AB - Let H be a tree on h ≥ 2 vertices. It is shown that if G = (V, E) is a graph with δ(G) ≥ (|V|/2) + 10h4√|V|log|V|, and h - 1 divides |E|, then there is a decomposition of the edges of G into copies of H. This result is asymptotically the best possible for all trees with at least three vertices.

KW - Decomposition

KW - Trees

UR - http://www.scopus.com/inward/record.url?scp=0032387781&partnerID=8YFLogxK

U2 - 10.1002/(SICI)1098-2418(199805)12:3<237::AID-RSA2>3.0.CO;2-W

DO - 10.1002/(SICI)1098-2418(199805)12:3<237::AID-RSA2>3.0.CO;2-W

M3 - Article

AN - SCOPUS:0032387781

SN - 1042-9832

VL - 12

SP - 237

EP - 251

JO - Random Structures and Algorithms

JF - Random Structures and Algorithms

IS - 3

ER -

Tree Decomposition of Graphs

Abstract

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this