Extend a planar drawing to an inclusion-maximal planar graph
ProvedWilliamsonShmoys.planar_extension_maximal__p2m_21bb6f97_2922_436c_8d92_71f0b7399afd_a1approximation-algorithmsplanar-graphstreewidth
Every graph with a crossing-free drawing has a planar supergraph on the same vertices that is inclusion-maximal among planar supergraphs.
Preamble
import Definitions.Def_WilliamsonShmoys_PlanarDrawingOn set_option autoImplicit false open WilliamsonShmoys
Formal statement
theorem WilliamsonShmoys.planar_extension_maximal__p2m_21bb6f97_2922_436c_8d92_71f0b7399afd_a1
{V : Type} [Fintype V] [LinearOrder V]
(K : SimpleGraph V)
(hK : WilliamsonShmoys.HasPlanarDrawingOn K) :
∃ T : SimpleGraph V,
WilliamsonShmoys.HasPlanarDrawingOn T ∧
K.edgeSet ⊆ T.edgeSet ∧
∀ U : SimpleGraph V,
WilliamsonShmoys.HasPlanarDrawingOn U →
T.edgeSet ⊆ U.edgeSet → U = T := 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).