Planar completion with Euler edge count
ProvedWilliamsonShmoys.exists_planar_euler_edge_count_completionapproximation-algorithmsplanar-graphstreewidth
Every finite drawable simple graph on at least three vertices has a planar supergraph on the same vertex type whose edge count is 3 times the number of vertices minus 6.
Preamble
import Mathlib import Definitions.Def_WilliamsonShmoys_PlanarDrawingOn set_option autoImplicit false
Formal statement
theorem WilliamsonShmoys.exists_planar_euler_edge_count_completion
{V : Type} [Fintype V] [LinearOrder V]
(H : SimpleGraph V)
(hV : 3 ≤ Fintype.card V)
(hH : WilliamsonShmoys.HasPlanarDrawingOn H) :
∃ J : SimpleGraph V,
H ≤ J ∧
WilliamsonShmoys.HasPlanarDrawingOn J ∧
J.edgeSet.ncard = 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).