Planar supergraph edge-count lower bound
ProvedWilliamsonShmoys.planar_supergraph_edge_count_lower__p2m_ce0752f6_2cc0_436b_9908_f6f14786777a_a1approximation-algorithmsplanar-graphstreewidth
Every graph with a crossing-free drawing on at least three vertices has a drawable supergraph on the same vertex type with at least 3|V|−6 edges. This isolates the augmentation and planar edge-count argument; maximality of the original graph is not assumed.
Preamble
import Mathlib import Definitions.Def_WilliamsonShmoys_PlanarDrawingOn set_option autoImplicit false open WilliamsonShmoys
Formal statement
theorem WilliamsonShmoys.planar_supergraph_edge_count_lower__p2m_ce0752f6_2cc0_436b_9908_f6f14786777a_a1
{V : Type} [Fintype V] [LinearOrder V]
(M : SimpleGraph V)
(hDraw : WilliamsonShmoys.HasPlanarDrawingOn M)
(hCard : 3 <= Fintype.card V) :
∃ N : SimpleGraph V, M ≤ N ∧
WilliamsonShmoys.HasPlanarDrawingOn N ∧
3 * Fintype.card V <= N.edgeSet.ncard + 6 := 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).