A drawable graph has an edge-maximal drawable extension
ProvedWilliamsonShmoys.drawable_graph_has_edge_maximal_drawable_extensionapproximation-algorithmsplanar-graphstreewidth
Every drawable graph on a finite ordered vertex type has a drawable supergraph that has no strictly larger drawable supergraph on the same vertices.
Preamble
import Definitions.Def_WilliamsonShmoys_PlanarDrawingOn open WilliamsonShmoys set_option autoImplicit false
Formal statement
theorem WilliamsonShmoys.drawable_graph_has_edge_maximal_drawable_extension
{V : Type} [Fintype V] [LinearOrder V]
(H : SimpleGraph V)
(hH : HasPlanarDrawingOn H) :
∃ M : SimpleGraph V, H ≤ M ∧ HasPlanarDrawingOn M ∧
∀ L : SimpleGraph V, M ≤ L → HasPlanarDrawingOn L → L ≤ M := 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).