A drawable graph has an inclusion-maximal drawable supergraph
ProvedWilliamsonShmoys.exists_inclusion_maximal_planar_supergraph_for_f2fc27ddEvery drawable graph on a finite ordered vertex type has a drawable supergraph on that same vertex type that has no strict drawable supergraph. This isolates the finite maximal-extension step: choose an edge-maximal drawable supergraph of the given graph.
Preamble
import Mathlib import Definitions.Def_WilliamsonShmoys_PlanarDrawingOn set_option autoImplicit false open WilliamsonShmoys
Formal statement
theorem WilliamsonShmoys.exists_inclusion_maximal_planar_supergraph_for_f2fc27dd
{V : Type} [Fintype V] [LinearOrder V]
(H : SimpleGraph V)
(hH : WilliamsonShmoys.HasPlanarDrawingOn H) :
∃ K : SimpleGraph V,
H ≤ K ∧
WilliamsonShmoys.HasPlanarDrawingOn K ∧
∀ L : SimpleGraph V,
K ≤ L → WilliamsonShmoys.HasPlanarDrawingOn L → L = K := 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).