Planar drawings extend to a triangulation on the same vertices
ProvedWilliamsonShmoys.planar_drawing_has_triangulation_extensionapproximation-algorithmsplanar-graphstreewidth
Any simply drawn planar graph on at least three vertices has a planar supergraph on the same vertices with exactly 3|V|−6 edges. The lower bound on the vertex count is needed for the triangulation count, including the three-vertex boundary case.
Preamble
import Mathlib import Definitions.Def_WilliamsonShmoys_PlanarDrawingOn set_option autoImplicit false
Formal statement
theorem WilliamsonShmoys.planar_drawing_has_triangulation_extension
{V : Type} [Fintype V] [LinearOrder V]
(N : SimpleGraph V)
(hN : WilliamsonShmoys.HasPlanarDrawingOn N)
(hV : 3 ≤ Fintype.card V) :
∃ K : SimpleGraph V,
N ≤ K ∧
WilliamsonShmoys.HasPlanarDrawingOn K ∧
K.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).