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