Existence of an edge-maximal drawable extension
ProvedWilliamsonShmoys.planarDrawingOn_maximal_extension_existsEvery drawable graph on a finite vertex type has a drawable supergraph on the same vertices that is maximal under edge inclusion among drawable supergraphs.
Preamble
import Definitions.Def_WilliamsonShmoys_PlanarDrawingOn open WilliamsonShmoys set_option autoImplicit false
Formal statement
theorem WilliamsonShmoys.planarDrawingOn_maximal_extension_exists
{V : Type} [Fintype V] [LinearOrder V]
(U : SimpleGraph V) (hDraw : HasPlanarDrawingOn U) :
∃ W : SimpleGraph V, U ≤ W ∧ HasPlanarDrawingOn W ∧
∀ X : SimpleGraph V, W ≤ X → HasPlanarDrawingOn 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).