Existence of a maximal drawable supergraph
ProvedWilliamsonShmoys.exists_maximal_planar_supergraph__p2m_68514819_a212_4a71_843f_93b3ee5d7783_a2Every drawable graph on a finite vertex type is contained in a drawable graph that is maximal among drawable supergraphs on that same vertex type.
Preamble
import Mathlib import Definitions.Def_WilliamsonShmoys_PlanarDrawingOn open WilliamsonShmoys set_option autoImplicit false
Formal statement
theorem WilliamsonShmoys.exists_maximal_planar_supergraph__p2m_68514819_a212_4a71_843f_93b3ee5d7783_a2
{V : Type} [Fintype V] [LinearOrder V]
(H : SimpleGraph V)
(hH : WilliamsonShmoys.HasPlanarDrawingOn H) :
∃ K : SimpleGraph V,
H ≤ K ∧ WilliamsonShmoys.HasPlanarDrawingOn K ∧
∀ L : SimpleGraph V, K ≤ L →
WilliamsonShmoys.HasPlanarDrawingOn L → L ≤ 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).