Extend a planar drawing to a triangulation on the same vertices
ProvedWilliamsonShmoys.planar_triangulation_extension__p2m_ddd64127_46c6_4ff5_ad6f_47496ad35234_a2approximation-algorithmsplanar-graphstreewidth
Every finite simple graph with the supplied crossing-free drawing and at least three vertices is a subgraph, on the same vertex set, of a graph with a decidable adjacency relation and exactly 3|V|−6 edges that admits a triangulation of the plane.
Preamble
import Definitions.Def_WilliamsonShmoys_PlanarDrawingOn import Mathlib set_option autoImplicit false
Formal statement
theorem WilliamsonShmoys.planar_triangulation_extension__p2m_ddd64127_46c6_4ff5_ad6f_47496ad35234_a2
{V : Type} [Fintype V] [LinearOrder V]
(H : SimpleGraph V) (dH : DecidableRel H.Adj)
(hH : WilliamsonShmoys.HasPlanarDrawingOn H)
(hcard : 3 <= Fintype.card V) :
Exists fun K : SimpleGraph V =>
Exists fun dK : DecidableRel K.Adj =>
H.edgeFinset ⊆ K.edgeFinset ∧
K.edgeFinset.card = 3 * Fintype.card V - 6 := 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).