A sparse drawable graph has a drawable strict extension
ProvedWilliamsonShmoys.planarDrawingOn_addEdge_when_below_triangulation_countapproximation-algorithmsplanar-graphstreewidth
If a drawable simple graph on at least three vertices has fewer than 3n−6 edges, some strict supergraph on the same vertices is also drawable.
Preamble
import Mathlib import Definitions.Def_WilliamsonShmoys_PlanarDrawingOn open WilliamsonShmoys set_option autoImplicit false
Formal statement
theorem WilliamsonShmoys.planarDrawingOn_addEdge_when_below_triangulation_count
{V : Type} [Fintype V] [LinearOrder V]
(S : SimpleGraph V)
(hS : WilliamsonShmoys.HasPlanarDrawingOn S)
(hCard : 3 ≤ Fintype.card V)
(hBelow : S.edgeSet.ncard + 6 < 3 * Fintype.card V) :
∃ T : SimpleGraph V, S < T ∧ WilliamsonShmoys.HasPlanarDrawingOn T := 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).