A maximum-edge planar supergraph exists
ProvedWilliamsonShmoys.maximal_planar_supergraph_max_edges__p2m_98144ef0_c988_4b8f_aaba_1bdea0bce009_a3approximation-algorithmsplanar-graphstreewidth
Among the planar supergraphs of K on the finite vertex type V, one has at least as many edges as every other planar supergraph.
Preamble
import Definitions.Def_WilliamsonShmoys_PlanarDrawingOn open WilliamsonShmoys
Formal statement
theorem WilliamsonShmoys.maximal_planar_supergraph_max_edges__p2m_98144ef0_c988_4b8f_aaba_1bdea0bce009_a3
{V : Type} [Fintype V] [LinearOrder V]
(K : SimpleGraph V)
(hDraw : HasPlanarDrawingOn K) :
∃ L : SimpleGraph V, K ≤ L ∧ HasPlanarDrawingOn L ∧
(∀ M : SimpleGraph V, K ≤ M → HasPlanarDrawingOn M →
Set.ncard M.edgeSet ≤ Set.ncard 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).