A short proof that every finite graph has a tree-decomposition displaying its tangles
Accepted version
Peer-reviewed
Repository URI
Repository DOI
Change log
Authors
Carmesin, J
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.
Description
This is the author accepted manuscript. The final version is available from Elsevier via http://dx.doi.org/10.1016/j.ejc.2016.04.007
Keywords
4901 Applied Mathematics, 4904 Pure Mathematics, 49 Mathematical Sciences
Journal Title
European Journal of Combinatorics
Conference Name
Journal ISSN
0195-6698
1095-9971
1095-9971
Volume Title
58
Publisher
Elsevier BV
Publisher DOI
Sponsorship
Emmanuel College