Existence of a maximal drawable extension
ProvedWilliamsonShmoys.maximal_planar_extension_exists__p2m_2facc1d9_8574_46e5_b6ec_a0ba2784b822_a2approximation-algorithmsplanar-graphstreewidth
Every drawable finite graph has a supergraph on the same vertex type that is drawable and inclusion-maximal among drawable supergraphs. Prove this by maximizing edge count over the finite set of drawable supergraphs containing the input graph. This removes the augmentation step from the parent; it does not establish the edge count.
Preamble
import Mathlib import Definitions.Def_WilliamsonShmoys_PlanarDrawingOn set_option autoImplicit false open WilliamsonShmoys
Formal statement
theorem WilliamsonShmoys.maximal_planar_extension_exists__p2m_2facc1d9_8574_46e5_b6ec_a0ba2784b822_a2
{V : Type} [Fintype V] [LinearOrder V]
(G : SimpleGraph V) (hG : WilliamsonShmoys.HasPlanarDrawingOn G) :
∃ L : SimpleGraph V,
G ≤ L ∧
WilliamsonShmoys.HasPlanarDrawingOn L ∧
∀ H : SimpleGraph V, L ≤ H →
WilliamsonShmoys.HasPlanarDrawingOn H → H ≤ 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).