Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

A haven of order w+2 obstructs treewidth at most w

Proved
SeymourThomas1993.not_treewidth_le_of_haven

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

dualitygraph-theorytreewidth

A haven of order w+2 prevents a graph from having a finite tree decomposition whose bags all have size at most w+1. More generally, any finite tree decomposition has a bag meeting every member of any pairwise-touching family of nonempty connected vertex sets. Applied to the components selected by the haven for the decomposition bags, this contradicts the requirement that a selected component avoid its deletion bag. The obstruction holds even for an infinite ambient vertex type when the stated finite decomposition exists.

Preamble
import Definitions.Def_DvorakNorin2018_HavenCloudConfiguration
import Definitions.Def_RobertsonSeymour1986_GM5_TreewidthLE
set_option autoImplicit false
open StableMSR.Recovery.Havens RobertsonSeymour1986.GM5
Formal statement
namespace SeymourThomas1993
theorem not_treewidth_le_of_haven {V : Type} [DecidableEq V]
    {G : SimpleGraph V} {w : ℕ} {β : Finset V → Finset V}
    (hβ : Haven G (w+2) β) : ¬ TreewidthLE G w := by sorry
end SeymourThomas1993
Source
Seymour and Thomas, Graph searching and a min-max theorem for tree-width, JCTB 58 (1993), min-max theorem, easy direction. See also Mazoit, https://arxiv.org/pdf/1309.2266, p. 3, backward implication; this proof uses the equivalent Helly property of subtrees.

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