Augment a drawable graph to a triangulated supergraph
ProvedWilliamsonShmoys.exists_triangulated_drawable_supergraph_for_edge_countapproximation-algorithmsplanar-graphstreewidth
Every drawable finite simple graph with at least three vertices has a drawable supergraph on the same vertex type with exactly 3|V|−6 edges. This packages planar augmentation to a maximal triangulation together with the Euler-formula edge count.
Preamble
import Mathlib import Definitions.Def_WilliamsonShmoys_PlanarDrawingOn set_option autoImplicit false
Formal statement
theorem WilliamsonShmoys.exists_triangulated_drawable_supergraph_for_edge_count {V : Type} [Fintype V] [LinearOrder V] (S : SimpleGraph V) (hSdraw : WilliamsonShmoys.HasPlanarDrawingOn S) (hCard : 3 ≤ Fintype.card V) : ∃ T : SimpleGraph V, S ≤ T ∧ WilliamsonShmoys.HasPlanarDrawingOn T ∧ 3 * Fintype.card V = T.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).