Existence of an edge-maximal drawable extension
ProvedWilliamsonShmoys.maximal_planar_supergraph_exists__p2m_8b27cfb4_0f8b_46ed_98a5_9ae477e5a402_a1approximation-algorithmsplanar-graphstreewidth
Every drawable finite simple graph has an inclusion-maximal drawable supergraph on the same vertex set.
Preamble
import Definitions.Def_WilliamsonShmoys_PlanarDrawingOn set_option autoImplicit false open scoped BigOperators
Formal statement
theorem WilliamsonShmoys.maximal_planar_supergraph_exists__p2m_8b27cfb4_0f8b_46ed_98a5_9ae477e5a402_a1
{V : Type} [Fintype V] [LinearOrder V]
(G : SimpleGraph V) (hG : WilliamsonShmoys.HasPlanarDrawingOn G) :
∃ K : SimpleGraph V, G <= 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).