Augmenting a drawable graph below the planar edge bound
ProvedWilliamsonShmoys.drawable_graph_edge_augmentationapproximation-algorithmsplanar-graphstreewidth
If a drawable simple graph on at least three vertices has fewer than 3|V|−6 edges, one can add an edge while preserving drawability on the same vertex set. A proof can extend the drawing to a maximal planar graph, joining components through the unbounded face and adding a diagonal in any nontriangular face.
Preamble
import Mathlib import Definitions.Def_WilliamsonShmoys_PlanarDrawingOn open WilliamsonShmoys set_option autoImplicit false
Formal statement
theorem WilliamsonShmoys.drawable_graph_edge_augmentation
{V : Type} [Fintype V] [LinearOrder V]
(X : SimpleGraph V)
(hdraw : WilliamsonShmoys.HasPlanarDrawingOn X)
(hV : 3 ≤ Fintype.card V)
(hsmall : X.edgeSet.ncard + 6 < 3 * Fintype.card V) :
∃ Y : SimpleGraph V, X < Y ∧ WilliamsonShmoys.HasPlanarDrawingOn Y := 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).