Drawable graphs have triangulating supergraphs
ProvedWilliamsonShmoys.planar_graph_has_triangulating_supergraph_repair_a3780995_02f0_4c2f_a98c_6e5f167c3de5approximation-algorithmsplanar-graphstreewidth
Every drawable simple graph on a finite linearly ordered vertex type with at least three vertices has a drawable supergraph on the same vertices whose edge count is exactly three times the vertex count minus six.
Preamble
import Mathlib import Definitions.Def_WilliamsonShmoys_PlanarDrawingOn set_option autoImplicit false open WilliamsonShmoys
Formal statement
theorem WilliamsonShmoys.planar_graph_has_triangulating_supergraph_repair_a3780995_02f0_4c2f_a98c_6e5f167c3de5
{V : Type} [Fintype V] [LinearOrder V]
(G : SimpleGraph V) (hGdraw : WilliamsonShmoys.HasPlanarDrawingOn G)
(hCard : 3 ≤ Fintype.card V) :
∃ P : SimpleGraph V,
G ≤ P ∧ WilliamsonShmoys.HasPlanarDrawingOn P ∧
P.edgeSet.ncard + 6 = 3 * Fintype.card V := 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).