Drawable triangulated supergraph on the same vertices
ProvedWilliamsonShmoys.drawable_triangulation_supergraphapproximation-algorithmsplanar-graphstreewidth
A finite simple drawable graph on at least three vertices is a subgraph of a drawable triangulation on the same vertices, whose edge count is three times the vertex count minus six.
Preamble
import Mathlib import Definitions.Def_WilliamsonShmoys_PlanarDrawingOn open WilliamsonShmoys set_option autoImplicit false
Formal statement
theorem WilliamsonShmoys.drawable_triangulation_supergraph {V : Type} [Fintype V] [LinearOrder V] (K : SimpleGraph V) (hdraw : HasPlanarDrawingOn K) (hV : 3 ≤ Fintype.card V) : ∃ L : SimpleGraph V, K ≤ L ∧ HasPlanarDrawingOn L ∧ 3 * Fintype.card V - 6 = L.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).