Finite maximal drawable supergraph exists

Proved

WilliamsonShmoys.planar_supergraph_maximal_extension__p2m_af412bdb_08d3_443e_9526_1f4e854292c2_a1

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

approximation-algorithmsplanar-graphstreewidth

Every drawable graph on a finite vertex type has a drawable supergraph on the same vertices that is maximal among drawable supergraphs under inclusion. This removes the finite maximization step from the parent; an independent proof route is to maximize edge count over the finite, nonempty collection of drawable supergraphs of the input graph.

Preamble

import Definitions.Def_WilliamsonShmoys_PlanarDrawingOn
import Mathlib

open WilliamsonShmoys

Formal statement

theorem WilliamsonShmoys.planar_supergraph_maximal_extension__p2m_af412bdb_08d3_443e_9526_1f4e854292c2_a1
    {V : Type} [Fintype V] [LinearOrder V]
    (L : SimpleGraph V) (hL : HasPlanarDrawingOn L) :
    ∃ M : SimpleGraph V, L ≤ M ∧ HasPlanarDrawingOn M ∧
      ∀ N : SimpleGraph V, M ≤ N → HasPlanarDrawingOn N → N ≤ M := 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