Every drawable finite graph has a maximal drawable supergraph on the same vertices

Proved

WilliamsonShmoys.exists_maximal_drawable_supergraph__p2m_1ccfbc5e_ee72_4561_8bb6_ab9cee0a3a68_a1

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

approximation-algorithmsplanar-graphstreewidth

Any drawable simple graph on a finite ordered vertex type is contained in a drawable supergraph on the same vertices that has no strict drawable supergraph.

Preamble

import Definitions.Def_WilliamsonShmoys_PlanarDrawingOn
import Mathlib

open WilliamsonShmoys
set_option autoImplicit false

Formal statement

theorem WilliamsonShmoys.exists_maximal_drawable_supergraph__p2m_1ccfbc5e_ee72_4561_8bb6_ab9cee0a3a68_a1
    {V : Type} [Fintype V] [LinearOrder V]
    (G : SimpleGraph V) (hdrawing : HasPlanarDrawingOn G) :
    ∃ H : SimpleGraph V, G ≤ H ∧ HasPlanarDrawingOn H ∧
      ∀ K : SimpleGraph V, H ≤ K → HasPlanarDrawingOn K → K = H := 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