Extend a finite drawable graph to the maximal planar edge count
ProvedWilliamsonShmoys.maximal_planar_extension__p2m_ef21e4d0_72a9_49ba_9f8c_1146d558edeb_a4__p2m_ef21e4d0_72a9_49ba_9f8c_1146d558edeb_a5approximation-algorithmsplanar-graphstreewidth
Every finite drawable graph on at least three vertices is a subgraph, on the same vertex set, of a drawable graph with exactly 3|V|−6 edges.
Preamble
import Mathlib import Definitions.Def_WilliamsonShmoys_PlanarDrawingOn set_option autoImplicit false open WilliamsonShmoys
Formal statement
theorem WilliamsonShmoys.maximal_planar_extension__p2m_ef21e4d0_72a9_49ba_9f8c_1146d558edeb_a4__p2m_ef21e4d0_72a9_49ba_9f8c_1146d558edeb_a5
{V : Type} [Fintype V] [LinearOrder V]
(T : SimpleGraph V) (hCard : 3 <= Fintype.card V)
(hT : HasPlanarDrawingOn T) :
exists U : SimpleGraph V,
(forall x y, T.Adj x y -> U.Adj x y) /\
HasPlanarDrawingOn U /\
U.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).