A short proof that every finite graph has a tree-decomposition displaying its tangles

Carmesin, J

View / Open Files

Accepted version (PDF, 226Kb)

Authors

Carmesin, J

Publication Date

2016

Journal Title

European Journal of Combinatorics

ISSN

0195-6698

Publisher

Elsevier BV

Volume

Pages

61-65

Language

English

Type

Article

This Version

Metadata

Show full item record

Citation

Carmesin, J. (2016). A short proof that every finite graph has a tree-decomposition displaying its tangles. European Journal of Combinatorics, 58 61-65. https://doi.org/10.1016/j.ejc.2016.04.007

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

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.

Sponsorship

Emmanuel College

Identifiers

External DOI: https://doi.org/10.1016/j.ejc.2016.04.007

This record's URL: https://www.repository.cam.ac.uk/handle/1810/256296

Rights

Attribution-NonCommercial-NoDerivatives 4.0 International

Licence URL: http://creativecommons.org/licenses/by-nc-nd/4.0/

Statistics

Total file downloads (since January 2020). For more information on metrics see the IRUS guide.

The following licence files are associated with this item:

Creative Commons

Except where otherwise noted, this item's licence is described as Attribution-NonCommercial-NoDerivatives 4.0 International