Every finite drawable graph has a maximal drawable supergraph
ProvedWilliamsonShmoys.planar_drawable_graph_has_maximal_supergraphapproximation-algorithmsplanar-graphstreewidth
Any finite graph with a drawing satisfying HasPlanarDrawingOn is contained in a drawable graph that has no strictly larger drawable supergraph on the same vertex type.
Preamble
import Mathlib import Definitions.Def_WilliamsonShmoys_PlanarDrawingOn set_option autoImplicit false open WilliamsonShmoys
Formal statement
theorem WilliamsonShmoys.planar_drawable_graph_has_maximal_supergraph
{V : Type} [Fintype V] [LinearOrder V]
(S : SimpleGraph V)
(hS : WilliamsonShmoys.HasPlanarDrawingOn S) :
∃ R : SimpleGraph V,
WilliamsonShmoys.HasPlanarDrawingOn R ∧
S ≤ R ∧
∀ T : SimpleGraph V,
WilliamsonShmoys.HasPlanarDrawingOn T →
R ≤ T → T = R := 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).