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

Research output: Contribution to journalArticlepeer-review

3 Citations (Scopus)
107 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 languageEnglish
Pages (from-to)61-65
JournalEuropean Journal of Combinatorics
Volume58
Early online date8 Jun 2016
DOIs
Publication statusPublished - Nov 2016

Keywords

  • math.CO
  • 05C83, 05B35

Fingerprint

Dive into the research topics of 'A short proof that every finite graph has a tree-decomposition displaying its tangles'. Together they form a unique fingerprint.

Cite this