Existence of an edge-maximal planar supergraph
ProvedWilliamsonShmoys.maximal_planar_supergraph__p2m_d7d089da_42dd_4fb9_9d5f_fd887681c907_a1__p2m_d7d089da_42dd_4fb9_9d5f_fd887681c907_a2approximation-algorithmsplanar-graphstreewidth
Every finite planar graph on this vertex type has a planar supergraph that is maximal under edge inclusion among planar graphs on the same vertices.
Preamble
import Mathlib.Tactic import Definitions.Def_WilliamsonShmoys_PlanarDrawingOn set_option autoImplicit false
Formal statement
theorem WilliamsonShmoys.maximal_planar_supergraph__p2m_d7d089da_42dd_4fb9_9d5f_fd887681c907_a1__p2m_d7d089da_42dd_4fb9_9d5f_fd887681c907_a2
{V : Type} [Fintype V] [LinearOrder V]
(L : SimpleGraph V)
(hLplanar : WilliamsonShmoys.HasPlanarDrawingOn L) :
∃ M : SimpleGraph V,
L.edgeSet ≤ M.edgeSet ∧
WilliamsonShmoys.HasPlanarDrawingOn M ∧
∀ N : SimpleGraph V,
M.edgeSet ≤ N.edgeSet →
WilliamsonShmoys.HasPlanarDrawingOn N →
N.edgeSet = M.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).