Extend a finite planar drawing to a maximal planar graph
ProvedWilliamsonShmoys.planar_drawing_has_triangulating_extensionapproximation-algorithmsplanar-graphstreewidth
For every drawable simple graph on at least three vertices, there is a drawable supergraph on the same vertices whose edge count is exactly 3|V|−6, and the original edge count is no larger. The inclusion and count inequality make the final reduction independent of any particular finite-set cardinality API.
Preamble
import Definitions.Def_WilliamsonShmoys_PlanarDrawingOn set_option autoImplicit false open WilliamsonShmoys
Formal statement
theorem WilliamsonShmoys.planar_drawing_has_triangulating_extension
{V : Type} [Fintype V] [LinearOrder V]
(T : SimpleGraph V)
(hV : 3 ≤ Fintype.card V)
(hT : HasPlanarDrawingOn T) :
∃ U : SimpleGraph V,
T.edgeSet ⊆ U.edgeSet ∧
HasPlanarDrawingOn U ∧
T.edgeSet.ncard ≤ U.edgeSet.ncard ∧
U.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).