Finite edge maximal planar extension
ProvedWilliamsonShmoys.planar_drawable_edge_maximal_supergraph__p2m_60f46665_7c74_42d7_b1ac_33e75a012818_a1approximation-algorithmsplanar-graphstreewidth
Every drawable finite simple graph has a drawable supergraph on the same vertices that is maximal under edge inclusion.
Preamble
import Definitions.Def_WilliamsonShmoys_PlanarDrawingOn set_option autoImplicit false
Formal statement
theorem WilliamsonShmoys.planar_drawable_edge_maximal_supergraph__p2m_60f46665_7c74_42d7_b1ac_33e75a012818_a1
{V : Type} [Fintype V] [LinearOrder V]
(K : SimpleGraph V)
(hK : WilliamsonShmoys.HasPlanarDrawingOn K)
(hcard : 3 ≤ Fintype.card V) :
∃ L : SimpleGraph V, K.edgeSet ⊆ L.edgeSet ∧
WilliamsonShmoys.HasPlanarDrawingOn L ∧
(∀ M : SimpleGraph V, L.edgeSet ⊆ M.edgeSet →
WilliamsonShmoys.HasPlanarDrawingOn M → M.edgeSet = L.edgeSet) := 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).