Existence of a maximal drawable supergraph for the planar edge bound
ProvedWilliamsonShmoys.exists_maximal_planar_supergraph_edge_bound_9a40956c04dd448b9ab680f8d2edf7ceAny drawable finite simple graph is contained in a drawable supergraph on the same vertices that is maximal among drawable supergraphs.
Preamble
import Mathlib import Definitions.Def_WilliamsonShmoys_PlanarDrawingOn set_option autoImplicit false
Formal statement
theorem WilliamsonShmoys.exists_maximal_planar_supergraph_edge_bound_9a40956c04dd448b9ab680f8d2edf7ce
{V : Type} [Fintype V] [LinearOrder V] (L : SimpleGraph V)
(hL : WilliamsonShmoys.HasPlanarDrawingOn L) :
∃ K : SimpleGraph V,
L ≤ K ∧ WilliamsonShmoys.HasPlanarDrawingOn K ∧
∀ H : SimpleGraph V, K ≤ H →
WilliamsonShmoys.HasPlanarDrawingOn H → H = K := 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).