A simple proof of the tree-width duality theorem

Frédéric Mazoit (1)

1 LaBRI - Laboratoire Bordelais de Recherche en Informatique

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.

Mots clés: tree-width; bramble; duality

Domaines: Combinatoire [math.CO]

Frédéric Mazoit. A simple proof of the tree-width duality theorem. 2013. ⟨hal-00859912⟩