Extend a drawn planar graph to a triangulation
ProvedWilliamsonShmoys.exists_planar_supergraph_with_euler_edge_countapproximation-algorithmsplanar-graphstreewidth
Any finite simple graph with at least three vertices and a crossing-free drawing can be extended, on the same vertex set, to a drawn triangulation with exactly 3|V|−6 edges; the original edge set is included in the extension.
Preamble
import Mathlib import Definitions.Def_WilliamsonShmoys_PlanarDrawingOn
Formal statement
theorem WilliamsonShmoys.exists_planar_supergraph_with_euler_edge_count
{V : Type} [Fintype V] [LinearOrder V]
(H : SimpleGraph V)
(hV : 3 ≤ Fintype.card V)
(hH : WilliamsonShmoys.HasPlanarDrawingOn H) :
∃ K : SimpleGraph V,
H.edgeSet ⊆ K.edgeSet ∧
WilliamsonShmoys.HasPlanarDrawingOn K ∧
H.edgeSet.ncard ≤ K.edgeSet.ncard ∧
K.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).