Existence of a maximal drawable extension
ProvedWilliamsonShmoys.exists_maximal_planar_extension_9367f2acEvery drawable graph on a finite ordered vertex type has a drawable supergraph on the same vertices with no strict drawable supergraph.
Preamble
import Mathlib import Definitions.Def_WilliamsonShmoys_PlanarDrawingOn open WilliamsonShmoys set_option autoImplicit false
Formal statement
theorem WilliamsonShmoys.exists_maximal_planar_extension_9367f2ac
{V : Type} [Fintype V] [LinearOrder V]
(K : SimpleGraph V)
(hDraw : WilliamsonShmoys.HasPlanarDrawingOn K) :
∃ L : SimpleGraph V,
K ≤ L ∧
WilliamsonShmoys.HasPlanarDrawingOn L ∧
∀ M : SimpleGraph V, L ≤ M →
WilliamsonShmoys.HasPlanarDrawingOn M → M = L := 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).