Planar supergraph with the planar edge lower bound
ProvedWilliamsonShmoys.planar_supergraph_edge_count_lower_boundapproximation-algorithmsplanar-graphstreewidth
Every drawable simple graph on at least three vertices has a drawable supergraph on the same vertex set with at least 3|V|−6 edges. This isolates the triangulation-completion step. A proof route is to extend the given plane embedding to a maximal plane graph without adding vertices, then use Euler’s formula and the fact that every face of a maximal plane graph is triangular. This includes exactly three vertices, where completion is the triangle. The parent applies its maximality hypothesis to this extension and transfers the edge bound back by equality of edge sets.
Preamble
import Mathlib import Definitions.Def_WilliamsonShmoys_PlanarDrawingOn set_option autoImplicit false open WilliamsonShmoys
Formal statement
theorem WilliamsonShmoys.planar_supergraph_edge_count_lower_bound
{V : Type} [Fintype V] [LinearOrder V]
(P : SimpleGraph V)
(hCard : 3 ≤ Fintype.card V)
(hP : WilliamsonShmoys.HasPlanarDrawingOn P) :
∃ Q : SimpleGraph V,
WilliamsonShmoys.HasPlanarDrawingOn Q ∧
Set.Subset P.edgeSet Q.edgeSet ∧
3 * Fintype.card V ≤ Q.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).