Planar triangulation completion with exact edge count
ProvedWilliamsonShmoys.planar_triangulation_completion__p2m_3060859a_0839_41c9_be06_b54269f75aee_a1approximation-algorithmsplanar-graphstreewidth
Any drawable simple graph on at least three vertices has a drawable supergraph on the same vertex set 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_triangulation_completion__p2m_3060859a_0839_41c9_be06_b54269f75aee_a1
{V : Type} [Fintype V] [LinearOrder V]
(J : SimpleGraph V)
(hV : 3 ≤ Fintype.card V)
(hPlanar : HasPlanarDrawingOn J) :
∃ N : SimpleGraph V,
J ≤ N ∧
HasPlanarDrawingOn N ∧
3 * Fintype.card V - 6 = N.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).