Planar augmentation to Euler edge count
ProvedWilliamsonShmoys.exists_planar_supergraph_euler_edge_countapproximation-algorithmsplanar-graphstreewidth
Every planar graph on a fixed finite vertex set of size at least three is a subgraph of a planar graph on that same vertex set with exactly 3|V| − 6 edges.
Preamble
import Definitions.Def_WilliamsonShmoys_PlanarDrawingOn set_option autoImplicit false
Formal statement
theorem WilliamsonShmoys.exists_planar_supergraph_euler_edge_count
{V : Type} [Fintype V] [LinearOrder V]
(N : SimpleGraph V)
(hV : 3 <= Fintype.card V)
(hN : WilliamsonShmoys.HasPlanarDrawingOn N) :
∃ K : SimpleGraph V,
N ≤ K ∧
WilliamsonShmoys.HasPlanarDrawingOn K ∧
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).