Tree Decomposition of Graphs

Research output: Contribution to journalArticlepeer-review


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.

Original languageEnglish
Pages (from-to)237-251
Number of pages15
JournalRandom Structures and Algorithms
Issue number3
StatePublished - May 1998


  • Decomposition
  • Trees

ASJC Scopus subject areas

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


Dive into the research topics of 'Tree Decomposition of Graphs'. Together they form a unique fingerprint.

Cite this