| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4653216 | European Journal of Combinatorics | 2016 | 5 Pages |
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.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Johannes Carmesin,