Planar drawings admit triangulated supergraphs
ProvedWilliamsonShmoys.planar_drawing_supergraph_with_triangulationapproximation-algorithmsplanar-graphstreewidth
Every drawable finite simple graph on at least three vertices has a drawable supergraph on the same vertex set with exactly 3n−6 edges. Such a supergraph is obtained by triangulating the faces of a planar embedding.
Preamble
import Mathlib import Definitions.Def_WilliamsonShmoys_PlanarDrawingOn set_option autoImplicit false
Formal statement
theorem WilliamsonShmoys.planar_drawing_supergraph_with_triangulation
{V : Type} [Fintype V] [LinearOrder V]
(Z : SimpleGraph V)
(hZ : WilliamsonShmoys.HasPlanarDrawingOn Z)
(hV : 3 ≤ Fintype.card V) :
∃ W : SimpleGraph V,
LE.le Z W ∧
WilliamsonShmoys.HasPlanarDrawingOn W ∧
3 * Fintype.card V - 6 = W.edgeSet.ncard := 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).