A simple proof of the tree-width duality theorem
Combinatorics
2013-09-10 v1
Abstract
We give a simple proof of the "tree-width duality theorem" of Seymour and Thomas that the tree-width of a finite graph is exactly one less than the largest order of its brambles.
Keywords
Cite
@article{arxiv.1309.2266,
title = {A simple proof of the tree-width duality theorem},
author = {Frédéric Mazoit},
journal= {arXiv preprint arXiv:1309.2266},
year = {2013}
}