Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Bramble extraction from gluing and star-decomposition properties

Proved
Mazoit2013.bramble_from_flap_families

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

dualitygraph-theorytreewidth

Let F be a finite family of admissible vertex sets of a graph G, and let D be a finite collection of nonempty subfamilies of F. Assume the following gluing property: if X belongs to a family dX, Y belongs to dY, and X and Y do not touch, there is a family d in D every member of which is contained in some member of dX other than X or some member of dY other than Y. Also assume that for each vertex set W of size less than k, D contains a family all of whose members are connected, nonempty, and disjoint from W. Then F contains a bramble of order at least k. These are precisely the finite extremal and star-family steps of the partial-decomposition proof; the graph-specific construction and gluing of partial tree decompositions are explicit hypotheses, not asserted by this theorem.

Preamble
import Definitions.Def_SeymourThomas1993_Brambles
set_option autoImplicit false
open StableMSR.Recovery.Brambles StableMSR.Recovery.Havens
Formal statement
namespace Mazoit2013
theorem bramble_from_flap_families {V : Type} [DecidableEq V]
    (G : SimpleGraph V) (F : Finset (Finset V)) (D : Finset (Finset (Finset V))) (k : ℕ)
    (hfamilies : ∀ d ∈ D, d.Nonempty ∧ d ⊆ F)
    (hglue : ∀ dX ∈ D, ∀ dY ∈ D, ∀ X ∈ dX, ∀ Y ∈ dY, ¬ Touch G X Y →
      ∃ d ∈ D, ∀ Z ∈ d,
        (∃ A ∈ dX, A ≠ X ∧ Z ⊆ A) ∨ (∃ A ∈ dY, A ≠ Y ∧ Z ⊆ A))
    (hstar : ∀ W : Finset V, W.card < k →
      ∃ d ∈ D, ∀ X ∈ d, ConnectedSet G X ∧ Disjoint W X) :
    ∃ B : Finset (Finset V), B ⊆ F ∧ IsBramble G B ∧ OrderAtLeast B k := by sorry
end Mazoit2013
Source
Mazoit, A simple proof of the tree-width duality theorem, https://arxiv.org/pdf/1309.2266, p. 3, forward implication, using Lemma 1 and star decompositions from p. 2.

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