Complete a planar drawing on the same vertex set
ProvedWilliamsonShmoys.planar_drawingOn_same_vertex_euler_completionapproximation-algorithmsplanar-graphstreewidth
A finite graph with at least three vertices and a crossing-free drawing can be extended, without adding vertices, to a planar graph with exactly 3|V|−6 edges.
Preamble
import Mathlib import Definitions.Def_WilliamsonShmoys_PlanarDrawingOn set_option autoImplicit false
Formal statement
theorem WilliamsonShmoys.planar_drawingOn_same_vertex_euler_completion {V : Type} [Fintype V] [LinearOrder V] (M : SimpleGraph V) (hM : WilliamsonShmoys.HasPlanarDrawingOn M) (hV : 3 ≤ Fintype.card V) : ∃ N : SimpleGraph V, WilliamsonShmoys.HasPlanarDrawingOn N ∧ M.edgeSet ⊆ N.edgeSet ∧ 3 * Fintype.card V = N.edgeSet.ncard + 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).