Entanglements

Abstract

Robertson and Seymour constructed for every graph $G$ a tree-decomposition that efficiently distinguishes all the tangles in $G$. While all previous constructions of these decompositions are either iterative in nature or not canonical, we give an explicit one-step construction that is canonical. The key ingredient is an axiomatisation of 'local properties' of tangles. Generalisations to locally finite graphs and matroids are also discussed.

8 pages, 4 figures

Cited by in corpus (1)

• Revisiting Linear Width: Rethinking the Relationship between Single Ideal and Linear Obstacle