Planar extension with triangulation edge count
ProvedWilliamsonShmoys.exists_triangulated_planar_extension_edge_countapproximation-algorithmsplanar-graphstreewidth
Any finite simple planar graph with at least three vertices is a subgraph of a planar graph on the same vertices with exactly 3n−6 edges.
Preamble
import Definitions.Def_WilliamsonShmoys_PlanarDrawingOn set_option autoImplicit false open WilliamsonShmoys
Formal statement
theorem WilliamsonShmoys.exists_triangulated_planar_extension_edge_count {V : Type} [Fintype V] [LinearOrder V] (H : SimpleGraph V) (hH : WilliamsonShmoys.HasPlanarDrawingOn H) (hV : 3 ≤ Fintype.card V) : ∃ J : SimpleGraph V, H.edgeSet ⊆ J.edgeSet ∧ WilliamsonShmoys.HasPlanarDrawingOn J ∧ J.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).