Complete a drawable graph to the maximal planar edge count
ProvedWilliamsonShmoys.maximal_planar_edge_completion_eb003b3d_a492_4a49_92ea_fad95e296393approximation-algorithmsplanar-graphstreewidth
Every drawable finite simple graph on at least three vertices has a drawable supergraph on the same vertex type with exactly 3 * card V - 6 edges.
Preamble
import Mathlib import Definitions.Def_WilliamsonShmoys_PlanarDrawingOn set_option autoImplicit false open WilliamsonShmoys
Formal statement
theorem WilliamsonShmoys.maximal_planar_edge_completion_eb003b3d_a492_4a49_92ea_fad95e296393
{V : Type} [Fintype V] [LinearOrder V]
(H : SimpleGraph V)
(hDraw : WilliamsonShmoys.HasPlanarDrawingOn H)
(hV : 3 ≤ Fintype.card V) :
∃ H' : SimpleGraph V,
H ≤ H' ∧ WilliamsonShmoys.HasPlanarDrawingOn H' ∧
H'.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).