Triangulated planar supergraph on the same vertices
ProvedWilliamsonShmoys.planar_connected_triangulation_supergraph__p2m_e072b4d5_a9ae_4f40_9238_0c277accf09b_a1approximation-algorithmsplanar-graphstreewidth
Every connected finite simple graph with the supplied crossing-free drawing and at least three vertices has a planar 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
Formal statement
theorem WilliamsonShmoys.planar_connected_triangulation_supergraph__p2m_e072b4d5_a9ae_4f40_9238_0c277accf09b_a1
{V : Type} [Fintype V] [LinearOrder V]
(M : SimpleGraph V)
(hM : WilliamsonShmoys.HasPlanarDrawingOn M)
(hConn : M.Connected)
(hCard : 3 ≤ Fintype.card V) :
∃ N : SimpleGraph V,
M.edgeSet ⊆ N.edgeSet ∧
WilliamsonShmoys.HasPlanarDrawingOn N ∧
N.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).