| dc.creator | Carmesin, Johannes | |
| dc.date.accessioned | 2016-04-26 | |
| dc.date.accessioned | 2018-11-24T23:26:46Z | |
| dc.date.available | 2016-06-14T11:06:50Z | |
| dc.date.available | 2018-11-24T23:26:46Z | |
| dc.date.issued | 2016-06-08 | |
| dc.identifier | https://www.repository.cam.ac.uk/handle/1810/256296 | |
| dc.identifier.uri | http://repository.aust.edu.ng/xmlui/handle/123456789/3883 | |
| dc.description.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. | |
| dc.language | en | |
| dc.publisher | Elsevier | |
| dc.publisher | European Journal of Combinatorics | |
| dc.rights | http://creativecommons.org/licenses/by-nc-nd/4.0/ | |
| dc.rights | Attribution-NonCommercial-NoDerivatives 4.0 International | |
| dc.title | A short proof that every finite graph has a tree-decomposition displaying its tangles | |
| dc.type | Article | |
