Planar completion with maximal edge count
ProvedWilliamsonShmoys.exists_triangulated_supergraph_edge_count__p2m_7671872f_ccc7_461e_8940_29831779f43a_a2approximation-algorithmsplanar-graphstreewidth
Every drawable finite simple graph on at least three vertices can be extended on the same vertex type to a drawable graph with exactly 3|V|−6 edges. Choose a drawable supergraph with the largest edge set among the finitely many supergraphs, then establish the maximal planar edge count by triangulation and Euler's formula.
Preamble
import Mathlib import Definitions.Def_WilliamsonShmoys_PlanarDrawingOn set_option autoImplicit false open WilliamsonShmoys
Formal statement
theorem WilliamsonShmoys.exists_triangulated_supergraph_edge_count__p2m_7671872f_ccc7_461e_8940_29831779f43a_a2
{V : Type} [Fintype V] [LinearOrder V]
(H : SimpleGraph V)
(hCard : 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).