Planar triangulation extension on the same vertex set
ProvedWilliamsonShmoys.exists_planar_triangulation_supergraph_same_verticesapproximation-algorithmsplanar-graphstreewidth
Every drawable simple graph on a finite ordered vertex set of at least three vertices has a drawable supergraph on the same vertex set with exactly 3|V|−6 edges. The parent uses maximality to identify this supergraph with the original graph.
Preamble
import Mathlib import Definitions.Def_WilliamsonShmoys_PlanarDrawingOn set_option autoImplicit false
Formal statement
theorem WilliamsonShmoys.exists_planar_triangulation_supergraph_same_vertices
{V : Type} [Fintype V] [LinearOrder V]
(S : SimpleGraph V)
(hV : 3 ≤ Fintype.card V)
(hS : WilliamsonShmoys.HasPlanarDrawingOn S) :
∃ T : SimpleGraph V,
S ≤ T ∧ WilliamsonShmoys.HasPlanarDrawingOn T ∧
T.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).