Planar drawing augmentation to a triangulated edge count
ProvedWilliamsonShmoys.planar_triangulation_augmentation__p2m_c356afa4_3905_47c7_8a37_a6d010ebe354_a1approximation-algorithmsplanar-graphstreewidth
Every drawable simple graph on a finite linearly ordered vertex type with at least three vertices is a subgraph of a drawable graph on the same vertices with exactly 3|V|−6 edges.
Preamble
import Mathlib import Definitions.Def_WilliamsonShmoys_PlanarDrawingOn open WilliamsonShmoys
Formal statement
theorem WilliamsonShmoys.planar_triangulation_augmentation__p2m_c356afa4_3905_47c7_8a37_a6d010ebe354_a1
{V : Type} [Fintype V] [LinearOrder V]
(H : SimpleGraph V)
(hV : 3 ≤ Fintype.card V)
(hH : WilliamsonShmoys.HasPlanarDrawingOn H) :
∃ T : SimpleGraph V, H ≤ 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).