Extend a drawable graph to a maximal drawable supergraph
ProvedWilliamsonShmoys.planar_completion_extend_maximal__p2m_a6f95464_e388_4a5e_9ab8_247431a72b86_a1approximation-algorithmsplanar-graphstreewidth
Every drawable simple graph on a finite fixed vertex set has an inclusion maximal drawable supergraph on that same vertex set. The finite collection of simple graphs on the vertex set permits choosing a maximal drawable extension; the drawing condition is retained as part of the choice.
Preamble
import Definitions.Def_WilliamsonShmoys_PlanarDrawingOn set_option autoImplicit false open WilliamsonShmoys
Formal statement
theorem WilliamsonShmoys.planar_completion_extend_maximal__p2m_a6f95464_e388_4a5e_9ab8_247431a72b86_a1
{V : Type} [Fintype V] [LinearOrder V] (P : SimpleGraph V)
(hP : WilliamsonShmoys.HasPlanarDrawingOn P) :
∃ Q : SimpleGraph V, P ≤ Q ∧
WilliamsonShmoys.HasPlanarDrawingOn Q ∧
∀ R : SimpleGraph V, Q ≤ R →
WilliamsonShmoys.HasPlanarDrawingOn R → R ≤ Q := 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).