Edge count of an inclusion-maximal planar drawing
ProvedWilliamsonShmoys.edge_count_of_inclusion_maximal_planar_drawingapproximation-algorithmsplanar-graphstreewidth
A graph maximal among same-vertex drawable supergraphs has exactly 3n − 6 edges when its finite vertex set has size n ≥ 3.
Preamble
import Mathlib import Definitions.Def_WilliamsonShmoys_PlanarDrawingOn set_option autoImplicit false open WilliamsonShmoys
Formal statement
theorem WilliamsonShmoys.edge_count_of_inclusion_maximal_planar_drawing
{V : Type} [Fintype V] [LinearOrder V]
(L : SimpleGraph V)
(hDrawing : WilliamsonShmoys.HasPlanarDrawingOn L)
(hMax : ∀ M : SimpleGraph V,
L ≤ M → WilliamsonShmoys.HasPlanarDrawingOn M → M ≤ L)
(n : Nat)
(hLarge : 3 ≤ n)
(hcard : Fintype.card V = n) :
L.edgeSet.ncard = 3 * n - 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).