Triangulate a drawable graph on the same vertex set
ProvedWilliamsonShmoys.planar_triangulation_supergraph_exact_edge_count__p2m_ff2dc3a7_bc0c_4f6e_ac65_1b9f4eedc148_a1approximation-algorithmsplanar-graphstreewidth
Every simply drawn planar simple graph on at least three vertices is contained in a simply drawn planar graph on the same vertices with exactly 3|V|−6 edges. The child accounts for disconnected graphs and the three-vertex boundary through the same fixed-vertex-set triangulation argument.
Preamble
import Mathlib import Definitions.Def_WilliamsonShmoys_PlanarDrawingOn set_option autoImplicit false open WilliamsonShmoys
Formal statement
theorem WilliamsonShmoys.planar_triangulation_supergraph_exact_edge_count__p2m_ff2dc3a7_bc0c_4f6e_ac65_1b9f4eedc148_a1
{V : Type} [Fintype V] [LinearOrder V] (M : SimpleGraph V)
(hCard : 3 ≤ Fintype.card V)
(hM : WilliamsonShmoys.HasPlanarDrawingOn M) :
∃ N : SimpleGraph V, M ≤ N ∧ WilliamsonShmoys.HasPlanarDrawingOn N ∧
3 * Fintype.card V - 6 = N.edgeSet.ncard := 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).