Existence of a maximal drawable supergraph
ProvedWilliamsonShmoys.planar_edge_augmentation_54a0e51c_maximal_drawable_supergraphapproximation-algorithmsplanar-graphstreewidth
Every drawable graph on a finite ordered vertex type is contained in a drawable graph that is maximal under edge inclusion among drawable supergraphs on the same vertex type.
Preamble
import Definitions.Def_WilliamsonShmoys_PlanarDrawingOn set_option autoImplicit false
Formal statement
theorem WilliamsonShmoys.planar_edge_augmentation_54a0e51c_maximal_drawable_supergraph
{V : Type} [Fintype V] [LinearOrder V]
(G : SimpleGraph V)
(hG : WilliamsonShmoys.HasPlanarDrawingOn G) :
∃ N : SimpleGraph V,
G.edgeSet ⊆ N.edgeSet ∧
WilliamsonShmoys.HasPlanarDrawingOn N ∧
∀ H : SimpleGraph V,
N.edgeSet ⊆ H.edgeSet →
WilliamsonShmoys.HasPlanarDrawingOn H →
H.edgeSet ⊆ N.edgeSet := 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).