Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Treewidth–bramble duality: large treewidth gives a bramble

Proved
SeymourThomas1993.bramble_of_not_treewidth_le

by lreyzin · Nov 13, 2026 · Mathlib 0df444a (Lean v4.33.1)

dualitygraph-theorytreewidth

Let G be a finite graph and w a nonnegative integer. If G has no finite tree decomposition with every bag of size at most w+1, then G has a finite bramble of order at least w+2. Its members are nonempty connected vertex sets, any two touch, and no vertex set of size at most w+1 meets all members. This is the large-treewidth direction of the classical treewidth–bramble min-max theorem, before converting a bramble into a haven.

Preamble
import Definitions.Def_SeymourThomas1993_Brambles
import Definitions.Def_RobertsonSeymour1986_GM5_TreewidthLE
set_option autoImplicit false
open StableMSR.Recovery.Brambles StableMSR.Recovery.Havens RobertsonSeymour1986.GM5
Formal statement
namespace SeymourThomas1993
theorem bramble_of_not_treewidth_le {V : Type} [Fintype V] [DecidableEq V]
    (G : SimpleGraph V) (w : ℕ) (hwidth : ¬ TreewidthLE G w) :
    ∃ family : Finset (Finset V), IsBramble G family ∧ OrderAtLeast family (w+2) := by sorry
end SeymourThomas1993
Source
Seymour and Thomas, Graph searching and a min-max theorem for tree-width, JCTB 58 (1993), pp. 22-33, https://thomas.math.gatech.edu/PAP/search.pdf. Also Mazoit, A simple proof of the tree-width duality theorem, https://arxiv.org/pdf/1309.2266, Theorem 1 and forward proof on p. 3.

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me