A simple proof of the tree-width duality theorem

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.

References in corpus (1)

• Partitions versus sets : a case of duality

Cited by in corpus (1)

• Obtaining trees of tangles from tangle-tree duality