Finite maximal extension for a graph property

Proved

finite_maximal_planar_property_extension__p2m_503a8d71_6799_480d_8f3e_33232e674c95_a1

by Eyal1990 · Nov 1, 2026 · Mathlib 0df444a (Lean v4.33.1)

approximation-algorithmsplanar-graphstreewidth

For any property of simple graphs on a finite ordered vertex type, every graph satisfying that property has a property-satisfying supergraph that is maximal under edge inclusion.

Preamble

import Definitions.Def_WilliamsonShmoys_PlanarDrawingOn
import Mathlib

open WilliamsonShmoys
set_option autoImplicit false

Formal statement

theorem finite_maximal_planar_property_extension__p2m_503a8d71_6799_480d_8f3e_33232e674c95_a1
    {V : Type} [Fintype V] [LinearOrder V]
    (P : SimpleGraph V → Prop)
    (M : SimpleGraph V) (dM : DecidableRel M.Adj)
    (hM : P M) :
    ∃ (N : SimpleGraph V) (dN : DecidableRel N.Adj),
      P N ∧
      (letI : DecidableRel M.Adj := dM
       letI : DecidableRel N.Adj := dN
       M.edgeFinset ⊆ N.edgeFinset) ∧
      (∀ (K : SimpleGraph V) (dK : DecidableRel K.Adj),
        P K →
        (letI : DecidableRel N.Adj := dN
         letI : DecidableRel K.Adj := dK
         N.edgeFinset ⊆ K.edgeFinset) →
        N = K) := 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