A simple proof of the tree-width duality theorem
classification
🧮 math.CO
keywords
tree-widthdualityproofsimpletheorembramblesexactlyfinite
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.