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

Johannes Carmesin

doi:10.1016/j.ejc.2016.04.007

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

Johannes Carmesin

Mathematics

Research output: Contribution to journal › Article › peer-review

3 Citations (Scopus)

139 Downloads (Pure)

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.

Original language	English
Pages (from-to)	61-65
Journal	European Journal of Combinatorics
Volume	58
Early online date	8 Jun 2016
DOIs	https://doi.org/10.1016/j.ejc.2016.04.007
Publication status	Published - Nov 2016

Keywords

math.CO
05C83, 05B35

Access to Document

10.1016/j.ejc.2016.04.007

Carmesin_Short_Proof_European_Journal_CombinatoricsAccepted author manuscript, 227 KBLicence: Creative Commons: Attribution-NonCommercial-NoDerivs (CC BY-NC-ND)

https://www.repository.cam.ac.uk/handle/1810/256296Licence: Creative Commons: Attribution-NonCommercial-NoDerivs (CC BY-NC-ND)

Cite this

@article{ca1d34682fae44e8b76345320eaa27d8,

title = "A short proof that every finite graph has a tree-decomposition displaying its tangles",

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 = "math.CO, 05C83, 05B35",

author = "Johannes Carmesin",

year = "2016",

month = nov,

doi = "10.1016/j.ejc.2016.04.007",

language = "English",

volume = "58",

pages = "61--65",

journal = "European Journal of Combinatorics",

issn = "0195-6698",

publisher = "Elsevier",

}

TY - JOUR

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

AU - Carmesin, Johannes

PY - 2016/11

Y1 - 2016/11

N2 - 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.

AB - 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.

KW - math.CO

KW - 05C83, 05B35

UR - https://www.scopus.com/pages/publications/84976517906

U2 - 10.1016/j.ejc.2016.04.007

DO - 10.1016/j.ejc.2016.04.007

M3 - Article

SN - 0195-6698

VL - 58

SP - 61

EP - 65

JO - European Journal of Combinatorics

JF - European Journal of Combinatorics

ER -

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

Abstract

Keywords

Access to Document

Fingerprint

Cite this