Edge count of a maximal planar graph
ProvedWilliamsonShmoys.edge_count_of_edge_maximal_drawable_graphapproximation-algorithmsplanar-graphstreewidth
A drawable graph on at least three vertices that has no strict drawable supergraph has exactly 3|V|−6 edges. In a plane embedding, maximality forces connectedness and triangular faces; Euler’s formula and the count of face-edge incidences then give the stated edge count. The hypothesis |V|≥3 is needed for this formula and its triangulation argument.
Preamble
import Mathlib import Definitions.Def_WilliamsonShmoys_PlanarDrawingOn set_option autoImplicit false open WilliamsonShmoys
Formal statement
theorem WilliamsonShmoys.edge_count_of_edge_maximal_drawable_graph
{V : Type} [Fintype V] [LinearOrder V]
(L : SimpleGraph V)
(hL : WilliamsonShmoys.HasPlanarDrawingOn L)
(hV : 3 ≤ Fintype.card V)
(hmax : ∀ M : SimpleGraph V,
L ≤ M → WilliamsonShmoys.HasPlanarDrawingOn M → M = 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).