Proof of `Edge Expansion Forces Linear Treewidth`
What this proof establishes
no assumptions
Assuming the claims on the left, the claim on the right holds — checked by the archive's pipeline. Proof code is not displayed here.
Description
Small components after deletion force a large deletion set. Connected sets containing more than half the vertices form a bramble, and tree Helly supplies a bag meeting every member.