Finite maximal drawable supergraph extension
ProvedWilliamsonShmoys.planar_drawingOn_maximal_extension_face_dataEvery drawable graph on a finite ordered vertex type has an inclusion-maximal drawable supergraph on the same vertices.
Preamble
import Mathlib import Definitions.Def_WilliamsonShmoys_PlanarDrawingOn set_option autoImplicit false open WilliamsonShmoys
Formal statement
theorem WilliamsonShmoys.planar_drawingOn_maximal_extension_face_data
{V : Type} [Fintype V] [LinearOrder V]
(H : SimpleGraph V)
(hDraw : HasPlanarDrawingOn H) :
∃ J : SimpleGraph V, H ≤ J ∧ HasPlanarDrawingOn J ∧
∀ K : SimpleGraph V, J ≤ K → HasPlanarDrawingOn K → K = J := 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).