Choose an inclusion-maximal drawable supergraph

Proved

WilliamsonShmoys.maximal_planar_drawing_extension__p2m_18964b7c_c181_43c8_b19b_00116e3fbbcb_a2

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

approximation-algorithmsplanar-graphstreewidth

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

Preamble

import Definitions.Def_WilliamsonShmoys_PlanarDrawingOn

set_option autoImplicit false

open WilliamsonShmoys

Formal statement

theorem WilliamsonShmoys.maximal_planar_drawing_extension__p2m_18964b7c_c181_43c8_b19b_00116e3fbbcb_a2
    {V : Type} [Fintype V] [LinearOrder V]
    (H : SimpleGraph V) [DecidableRel H.Adj]
    (hH : HasPlanarDrawingOn H) :
    ∃ (K : SimpleGraph V) (_ : DecidableRel K.Adj),
      H.edgeFinset ⊆ K.edgeFinset ∧
      HasPlanarDrawingOn K ∧
      (∀ (L : SimpleGraph V) [DecidableRel L.Adj],
        (∀ {u v}, K.Adj u v → L.Adj u v) →
        HasPlanarDrawingOn L →
        ∀ {u v}, L.Adj u v → K.Adj u v) := 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