A short proof that every finite graph has a tree-decomposition displaying its tangles
classification
🧮 math.CO
keywords
grapheveryfiniteproofshorttanglestree-decompositioncentral
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.