Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Finite downward-closed graph properties have maximal extensions

Proved
SimpleGraph.exists_maximal_supgraph_of_finite__p2m_2dea5b09_c429_4a5e_b3c1_b82fac24916e_a2

by Eyal1990 · Oct 30, 2026 · Mathlib 0df444a (Lean v4.33.1)

On a finite vertex type, every graph satisfying a downward-closed graph property is contained in a graph maximal among those satisfying the property.

Preamble
import Mathlib

set_option autoImplicit false
Formal statement
theorem SimpleGraph.exists_maximal_supgraph_of_finite__p2m_2dea5b09_c429_4a5e_b3c1_b82fac24916e_a2
    {V : Type} [Fintype V] (P : SimpleGraph V → Prop)
    (hdown : ∀ ⦃G H : SimpleGraph V⦄, H ≤ G → P G → P H)
    (K : SimpleGraph V) (hK : P K) :
    ∃ L : SimpleGraph V, K ≤ L ∧ P L ∧
      ∀ M : SimpleGraph V, L ≤ M → P M → M ≤ L := by sorry
Source
David P. Williamson and David B. Shmoys, The Design of Approximation Algorithms, Cambridge University Press, 2011, author electronic manuscript, Section 10.2, proof of Theorem 10.11, pp. 270-272. https://doi.org/10.1017/CBO9780511921735. Bounded tree-width of the pieces: Robertson–Seymour (planar graphs of radius r have tree-width at most 3r+1) / Bodlaender (k-outerplanar graphs have tree-width at most 3k-1).

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