A short proof that every finite graph has a tree-decomposition displaying its tangles

Abstract

We give a short proof that every finite graph (or matroid) has a tree-decomposition that displays all maximal tangles.

This theorem for graphs is a central result of the graph minors project of Robertson and Seymour and the extension to matroids is due to Geelen, Gerards and Whittle.