A simple proof of the tree-width duality theorem

Fr\'ed\'eric Mazoit (LaBRI)

A simple proof of the tree-width duality theorem

Not yet reviewed by Pith; the record is open.

Re-run · record.json Download PDF Read on arXiv ↗

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1309.2266 v1 pith:TM2FSNRZ submitted 2013-09-09 math.CO

Frédéric Mazoit (LaBRI) This is my paper · ORCID

classification math.CO

keywords tree-widthdualityproofsimpletheorembramblesexactlyfinite

verification ladder T0 review T1 audit T2 compute T3 formal

0 comments

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.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

Treewidth of Products of Graphs with High Treewidth
math.CO 2026-07 conditional novelty 8.0 of 10

The treewidth of the strong product of two graphs is at least the product of their treewidth-plus-ones, minus one; analogous bounds hold for pathwidth and Cartesian products.

Pith tools