Triangulation extension and edge count for a finite planar drawing
ProvedWilliamsonShmoys.planar_drawing_edge_count_triangulation_extension_3daebd93approximation-algorithmsplanar-graphstreewidth
Every finite drawable simple graph on at least three vertices can be extended on the same vertex set to a drawable graph with exactly edges. The parent applies maximality to this supergraph, so it equals the original graph and yields the target bound. At three vertices the extension is ; the proof must also join disconnected components before triangulating.
Preamble
import Mathlib import Definitions.Def_WilliamsonShmoys_PlanarDrawingOn set_option autoImplicit false
Formal statement
theorem WilliamsonShmoys.planar_drawing_edge_count_triangulation_extension_3daebd93
{V : Type} [Fintype V] [LinearOrder V]
(H : SimpleGraph V) (hV : 3 ≤ Fintype.card V)
(hH : WilliamsonShmoys.HasPlanarDrawingOn H) :
∃ K : SimpleGraph V, H ≤ 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).