Maximal planar extension on a fixed vertex set
ProvedWilliamsonShmoys.planar_drawing_on_maximal_extensionapproximation-algorithmsplanar-graphstreewidth
Every graph with a planar drawing on a finite ordered vertex type has a planar supergraph on that same vertex type that is maximal among planar supergraphs.
Preamble
import Definitions.Def_WilliamsonShmoys_PlanarDrawingOn set_option autoImplicit false
Formal statement
theorem WilliamsonShmoys.planar_drawing_on_maximal_extension
{V : Type} [Fintype V] [LinearOrder V]
(K : SimpleGraph V)
(hK : WilliamsonShmoys.HasPlanarDrawingOn K)
(hV : 3 ≤ Fintype.card V) :
∃ 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).