Every finite planar drawing has a maximal drawable completion
ProvedWilliamsonShmoys.planar_drawing_maximal_extension_730ed87f_4857_4202_bf37_5fbad1be2596Every drawable simple graph on a finite ordered vertex type is contained in a drawable supergraph on the same vertices that has no strictly larger drawable supergraph.
Preamble
import Mathlib import Definitions.Def_WilliamsonShmoys_PlanarDrawingOn
Formal statement
theorem WilliamsonShmoys.planar_drawing_maximal_extension_730ed87f_4857_4202_bf37_5fbad1be2596 {V : Type} [Fintype V] [LinearOrder V] (M : SimpleGraph V) (hM : WilliamsonShmoys.HasPlanarDrawingOn M) : ∃ T : SimpleGraph V, M ≤ T ∧ WilliamsonShmoys.HasPlanarDrawingOn T ∧ ∀ U : SimpleGraph V, T ≤ U → WilliamsonShmoys.HasPlanarDrawingOn U → U = T := 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).