Extend a drawable finite graph to an edge-maximal drawable supergraph

Proved

WilliamsonShmoys.planar_supergraph_edge_maximal__p2m_2266ad6e_a873_4db0_8a1d_ced08babaea4_a1

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

approximation-algorithmsplanar-graphstreewidth

Every drawable finite simple graph has a drawable supergraph on the same vertex type that is maximal under drawable supergraph inclusion.

Preamble

import Definitions.Def_WilliamsonShmoys_PlanarDrawingOn
import Mathlib

set_option autoImplicit false

open WilliamsonShmoys

Formal statement

theorem WilliamsonShmoys.planar_supergraph_edge_maximal__p2m_2266ad6e_a873_4db0_8a1d_ced08babaea4_a1
    {V : Type} [Fintype V] [LinearOrder V]
    (G : SimpleGraph V) (hplanar : HasPlanarDrawingOn G) :
    ∃ L : SimpleGraph V, G.edgeSet ⊆ L.edgeSet ∧
      HasPlanarDrawingOn L ∧
      ∀ K : SimpleGraph V, L.edgeSet ⊆ K.edgeSet →
        HasPlanarDrawingOn K → K.edgeSet = L.edgeSet := 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