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.
Original language | English |
---|---|
Pages (from-to) | 61-65 |
Journal | European Journal of Combinatorics |
Volume | 58 |
Early online date | 8 Jun 2016 |
DOIs | |
Publication status | Published - Nov 2016 |
Keywords
- math.CO
- 05C83, 05B35