2000 character limit reached
A simple proof of the tree-width duality theorem
Published 9 Sep 2013 in math.CO | (1309.2266v1)
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.
Paper Prompts
Sign up for free to create and run prompts on this paper.