Finite maximal drawable extension
ProvedWilliamsonShmoys.planar_maximal_extension__p2m_ed14ce5d_db85_45e0_baef_0034f9db9e54_a1approximation-algorithmsplanar-graphstreewidth
This child supplies the finite-order step used by the parent: among drawable supergraphs of U on the same finite vertex type, choose one maximal under inclusion. It follows from finiteness of the set of simple graphs on V and does not add a topological claim. A direct proof route is to maximize edge-set cardinality among drawable supergraphs; any proper drawable extension would have more edges. The parent still needs the separate maximal-planar edge-count theorem.
Preamble
import Mathlib import Definitions.Def_WilliamsonShmoys_PlanarDrawingOn set_option autoImplicit false open WilliamsonShmoys
Formal statement
theorem WilliamsonShmoys.planar_maximal_extension__p2m_ed14ce5d_db85_45e0_baef_0034f9db9e54_a1
{V : Type} [Fintype V] [LinearOrder V]
(U : SimpleGraph V)
(hU : WilliamsonShmoys.HasPlanarDrawingOn U) :
∃ W : SimpleGraph V,
WilliamsonShmoys.HasPlanarDrawingOn W ∧ U ≤ W ∧
∀ X : SimpleGraph V,
WilliamsonShmoys.HasPlanarDrawingOn X → W ≤ X → X ≤ W := 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).