Extend a drawable graph to a triangulation on the same vertices
ProvedWilliamsonShmoys.exists_planar_triangulation_extension_for_maximal_edge_bound_50a3c5c3approximation-algorithmsplanar-graphstreewidth
Every drawable simple graph on a finite linearly ordered vertex set of size at least three has a drawable supergraph on the same vertices with exactly 3n − 6 edges.
Preamble
import Mathlib import Definitions.Def_WilliamsonShmoys_PlanarDrawingOn set_option autoImplicit false
Formal statement
theorem WilliamsonShmoys.exists_planar_triangulation_extension_for_maximal_edge_bound_50a3c5c3
{V : Type} [Fintype V] [LinearOrder V]
(P : SimpleGraph V)
(hPdraw : WilliamsonShmoys.HasPlanarDrawingOn P)
(hCard : 3 ≤ Fintype.card V) :
∃ Q : SimpleGraph V,
P ≤ Q ∧
WilliamsonShmoys.HasPlanarDrawingOn Q ∧
Q.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).