Extend a drawable graph to an edge maximal drawable graph
ProvedWilliamsonShmoys.planar_drawing_maximal_extension__p2m_1fc721c4_d4d8_4a3d_8e5b_8d3e1462bbc6_a1approximation-algorithmsplanar-graphstreewidth
Every drawable finite simple graph has a drawable supergraph on the same vertices that is maximal under drawable supergraph inclusion. The proof route is finite maximization: the set of simple graphs on a finite vertex type is finite, the candidate family is nonempty because it contains the input graph, and a candidate with maximum edge count is inclusion maximal.
Preamble
import Definitions.Def_WilliamsonShmoys_PlanarDrawingOn open WilliamsonShmoys
Formal statement
theorem WilliamsonShmoys.planar_drawing_maximal_extension__p2m_1fc721c4_d4d8_4a3d_8e5b_8d3e1462bbc6_a1 {V : Type} [Fintype V] [LinearOrder V] (S : SimpleGraph V) (hS : HasPlanarDrawingOn S) : ∃ T : SimpleGraph V, S ≤ T ∧ HasPlanarDrawingOn T ∧ ∀ U : SimpleGraph V, T ≤ U → 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).