Existence of an edge-maximal drawable supergraph
ProvedWilliamsonShmoys.exists_edge_maximal_planar_supergraph__p2m_a5cf4edc_e88b_40ef_a197_b0d2fda5eb44_a1approximation-algorithmsplanar-graphstreewidth
Every drawable graph on a finite vertex type has a drawable supergraph that is maximal among drawable supergraphs on that same type.
Preamble
import Definitions.Def_WilliamsonShmoys_PlanarDrawingOn open WilliamsonShmoys set_option autoImplicit false
Formal statement
theorem WilliamsonShmoys.exists_edge_maximal_planar_supergraph__p2m_a5cf4edc_e88b_40ef_a197_b0d2fda5eb44_a1 {V : Type} [Fintype V] [LinearOrder V] (K : SimpleGraph V) (hK : HasPlanarDrawingOn K) : ∃ L : SimpleGraph V, K ≤ L ∧ HasPlanarDrawingOn L ∧ ∀ M : SimpleGraph V, L ≤ M → 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).