A short proof that every finite graph has a tree-decomposition displaying its tangles
Combinatorics
2016-06-01 v2
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.
Keywords
Cite
@article{arxiv.1511.02734,
title = {A short proof that every finite graph has a tree-decomposition displaying its tangles},
author = {Johannes Carmesin},
journal= {arXiv preprint arXiv:1511.02734},
year = {2016}
}