Every drawable graph has a maximal drawable supergraph
ProvedWilliamsonShmoys.exists_maximal_planar_supergraph__p2m_6f52b5a3_b090_4468_aa84_13620a15b574_a1approximation-algorithmsplanar-graphstreewidth
Every drawable finite graph has a drawable supergraph on the same vertices that has no strictly larger drawable supergraph. The route is finite maximization: among the finitely many edge sets containing M that admit a drawing, choose one of largest cardinality. This removes the existence and maximality choice from the parent. The relevant argument is that the class being maximized is nonempty (it contains M), and inclusion plus equal finite edge counts implies graph equality. No lower bound on |V| is needed for this child. The remaining core obligation is making the finite maximization argument work with the existential drawing predicate.
Preamble
import Mathlib import Definitions.Def_WilliamsonShmoys_PlanarDrawingOn set_option autoImplicit false open WilliamsonShmoys
Formal statement
theorem WilliamsonShmoys.exists_maximal_planar_supergraph__p2m_6f52b5a3_b090_4468_aa84_13620a15b574_a1 {V : Type} [Fintype V] [LinearOrder V] (M : SimpleGraph V) (hM : WilliamsonShmoys.HasPlanarDrawingOn M) : ∃ N : SimpleGraph V, Set.Subset M.edgeSet N.edgeSet ∧ WilliamsonShmoys.HasPlanarDrawingOn N ∧ ∀ P : SimpleGraph V, Set.Subset N.edgeSet P.edgeSet → WilliamsonShmoys.HasPlanarDrawingOn P → P = N := by sorrySource
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).