Canonical trees of tree-decompositions

Johannes Carmesin, Matthias Hamann, Babak Miraftab

Research output: Contribution to journalArticlepeer-review

Abstract

We prove that every graph has a canonical tree of tree-decompositions that distinguishes all principal tangles (these include the ends and various kinds of large finite dense structures) efficiently.

Here ‘trees of tree-decompositions’ are a slightly weaker notion than ‘tree-decompositions’ but much more well-behaved than ‘tree-like metric spaces’. This theorem is best possible in the sense that we give an example that ‘trees of tree-decompositions’ cannot be strengthened to ‘tree-decompositions’ in the above theorem.

This implies results of Dunwoody and Krön as well as of Carmesin, Diestel, Hundertmark and Stein. Beyond that for locally finite graphs our result gives for each k ε ℕ canonical tree-decompositions that distinguish all k-distinguishable ends efficiently.
Original languageEnglish
Pages (from-to)1-26
Number of pages26
JournalJournal of Combinatorial Theory. Series B
Volume152
Early online date14 Sep 2021
DOIs
Publication statusPublished - Jan 2022

Keywords

  • Graph
  • Canonical tree of tree-decomposition
  • Tangle
  • Profile
  • End

Fingerprint

Dive into the research topics of 'Canonical trees of tree-decompositions'. Together they form a unique fingerprint.

Cite this