Planar augmentation to the sharp edge count
ProvedWilliamsonShmoys.planar_drawing_augmentation_exact_edge_countapproximation-algorithmsplanar-graphstreewidth
Any finite simple graph with at least three vertices and a planar drawing has a planar supergraph on the same vertex type with exactly 3|V|−6 edges. The boundary case of three vertices gives the triangle. This constructive extension statement has no maximality hypothesis and supplies the specific supergraph needed by the parent.
Preamble
import Mathlib import Definitions.Def_WilliamsonShmoys_PlanarDrawingOn set_option autoImplicit false
Formal statement
theorem WilliamsonShmoys.planar_drawing_augmentation_exact_edge_count
{V : Type} [Fintype V] [LinearOrder V]
(T : SimpleGraph V)
(hT : WilliamsonShmoys.HasPlanarDrawingOn T)
(hV : 3 <= Fintype.card V) :
∃ U : SimpleGraph V,
T ≤ U ∧
WilliamsonShmoys.HasPlanarDrawingOn U ∧
U.edgeSet.ncard = 3 * Fintype.card V - 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).