Extend a planar drawing to a triangulation
ProvedWilliamsonShmoys.planar_drawing_triangulation_extension_9525bc2d_6e0d_4029_99f4_e9901dcdc86fapproximation-algorithmsplanar-graphstreewidth
Every graph with the specified crossing-free drawing on at least three vertices is a subgraph of a graph on the same vertices that also has such a drawing and has exactly 3|V|−6 edges. The child’s proof must augment the explicit drawing with noncrossing edges until the faces are triangular, then prove the edge count. The size hypothesis is required for this count and excludes smaller cases.
Preamble
import Mathlib import Definitions.Def_WilliamsonShmoys_PlanarDrawingOn set_option autoImplicit false
Formal statement
theorem WilliamsonShmoys.planar_drawing_triangulation_extension_9525bc2d_6e0d_4029_99f4_e9901dcdc86f
{V : Type} [Fintype V] [LinearOrder V]
(W : SimpleGraph V)
(hW : WilliamsonShmoys.HasPlanarDrawingOn W)
(hV : 3 ≤ Fintype.card V) :
∃ X : SimpleGraph V,
LE.le W X ∧
WilliamsonShmoys.HasPlanarDrawingOn X ∧
X.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).