Existence of a maximal planar supergraph
ProvedWilliamsonShmoys.planar_maximal_extension__p2m_9d0fb3ab_d66a_4954_897e_7905864f2bd9_a1approximation-algorithmsplanar-graphstreewidth
Every graph with a crossing-free drawing has a planar supergraph on the same finite ordered vertex type that is maximal among planar supergraphs and has at least as many edges.
Preamble
import Mathlib import Definitions.Def_WilliamsonShmoys_PlanarDrawingOn open WilliamsonShmoys
Formal statement
theorem WilliamsonShmoys.planar_maximal_extension__p2m_9d0fb3ab_d66a_4954_897e_7905864f2bd9_a1 {V : Type} [Fintype V] [LinearOrder V] (J : SimpleGraph V) (hPlanar : HasPlanarDrawingOn J) : ∃ H : SimpleGraph V, HasPlanarDrawingOn H ∧ J.edgeSet.ncard ≤ H.edgeSet.ncard ∧ ∀ K : SimpleGraph V, H ≤ K → HasPlanarDrawingOn K → K = H := 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).