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.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.