Triangulated drawable extension with maximal planar edge count
ProvedWilliamsonShmoys.maximal_drawable_graph_triangulated_extension_f4cab8f1_36b2_49a4_9100_a8a3956b9d6eapproximation-algorithmsplanar-graphstreewidth
Every drawable finite simple graph with at least three vertices has a drawable supergraph on the same vertices with exactly 3|V|−6 edges. This packages the triangulation extension and Euler-count argument; the parent uses it with maximality to identify the extension with the original graph.
Preamble
import Mathlib import Definitions.Def_WilliamsonShmoys_PlanarDrawingOn set_option autoImplicit false open WilliamsonShmoys
Formal statement
theorem WilliamsonShmoys.maximal_drawable_graph_triangulated_extension_f4cab8f1_36b2_49a4_9100_a8a3956b9d6e
{V : Type} [Fintype V] [LinearOrder V]
(K : SimpleGraph V) (hKdraw : HasPlanarDrawingOn K)
(hCard : 3 ≤ Fintype.card V) :
∃ L : SimpleGraph V, K ≤ L ∧ HasPlanarDrawingOn L ∧
L.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).