Planar augmentation with exact edge count
ProvedWilliamsonShmoys.planar_triangulation_extension_edge_count_repairAny finite graph with at least three vertices and a crossing-free drawing is contained, on the same vertices, in a drawable graph with exactly three times the number of vertices minus six edges. The parent uses maximality to identify this extension with the original graph.
Preamble
import Mathlib import Definitions.Def_WilliamsonShmoys_PlanarDrawingOn open WilliamsonShmoys set_option autoImplicit false
Formal statement
theorem WilliamsonShmoys.planar_triangulation_extension_edge_count_repair
{V : Type} [Fintype V] [LinearOrder V]
(K : SimpleGraph V)
(hCard : 3 ≤ Fintype.card V)
(hDraw : HasPlanarDrawingOn K) :
∃ L : SimpleGraph V,
(∀ u v, K.Adj u v → L.Adj u v) ∧
HasPlanarDrawingOn L ∧
L.edgeSet.ncard + 6 = 3 * Fintype.card V := 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).