Planar supergraph with maximal planar edge count
ProvedWilliamsonShmoys.maximal_planar_supergraph_with_euler_edge_countapproximation-algorithmsplanar-graphstreewidth
Every graph with the supplied planar drawing on at least three vertices is contained in a drawable simple graph on the same vertex type whose edge count is exactly three times the number of vertices minus six. The equation is written with addition to avoid truncated subtraction.
Preamble
import Definitions.Def_WilliamsonShmoys_PlanarDrawingOn set_option autoImplicit false
Formal statement
theorem WilliamsonShmoys.maximal_planar_supergraph_with_euler_edge_count
{V : Type} [Fintype V] [LinearOrder V]
(M : SimpleGraph V)
(hV : 3 ≤ Fintype.card V)
(hM : WilliamsonShmoys.HasPlanarDrawingOn M) :
∃ N : SimpleGraph V, M ≤ N ∧ WilliamsonShmoys.HasPlanarDrawingOn N ∧
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).