Completion of a drawable graph to a maximal planar graph
ProvedWilliamsonShmoys.exists_planar_completion_with_maximal_edge_count_0319396fapproximation-algorithmsplanar-graphstreewidth
Every drawable simple graph on a finite ordered vertex type with at least three vertices has a drawable supergraph on the same vertex set with exactly 3|V|−6 edges. This is the topological completion step; the parent theorem follows by applying maximality to that supergraph.
Preamble
import Mathlib import Definitions.Def_WilliamsonShmoys_PlanarDrawingOn set_option autoImplicit false open WilliamsonShmoys
Formal statement
theorem WilliamsonShmoys.exists_planar_completion_with_maximal_edge_count_0319396f
{V : Type} [Fintype V] [LinearOrder V]
(K : SimpleGraph V)
(hK : HasPlanarDrawingOn K)
(hV : 3 ≤ Fintype.card V) :
∃ L : SimpleGraph V,
K ≤ L ∧ HasPlanarDrawingOn L ∧
L.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).