Extend a planar drawing to a triangulation
ProvedWilliamsonShmoys.planar_drawing_extension_to_triangulationapproximation-algorithmsplanar-graphstreewidth
Any drawable simple graph on a fixed finite ordered vertex type with at least three vertices is a subgraph of a drawable graph on the same vertices having exactly 3|V|−6 edges.
Preamble
import Mathlib import Definitions.Def_WilliamsonShmoys_PlanarDrawingOn set_option autoImplicit false open WilliamsonShmoys
Formal statement
theorem WilliamsonShmoys.planar_drawing_extension_to_triangulation
{V : Type} [Fintype V] [LinearOrder V]
(N : SimpleGraph V)
(hCard : 3 ≤ Fintype.card V)
(hN : WilliamsonShmoys.HasPlanarDrawingOn N) :
∃ P : SimpleGraph V,
WilliamsonShmoys.HasPlanarDrawingOn P ∧
N.edgeSet ⊆ P.edgeSet ∧
P.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).