Edge count of a maximal planar graph
ProvedWilliamsonShmoys.edge_maximal_planar_graph_has_extremal_edge_countapproximation-algorithmsplanar-graphstreewidth
An edge-maximal planar graph on at least three finite vertices has exactly 3|V|−6 edges. This supplies the geometric and counting conclusion needed after the finite extension step. A proof route is to show that any nontriangular face admits an added diagonal, so maximality forces a triangulation; connectedness and Euler’s formula then give the edge count. The hypothesis of at least three vertices is essential to this standard formula and is preserved explicitly.
Preamble
import Mathlib import Definitions.Def_WilliamsonShmoys_PlanarDrawingOn set_option autoImplicit false open WilliamsonShmoys
Formal statement
theorem WilliamsonShmoys.edge_maximal_planar_graph_has_extremal_edge_count
{V : Type} [Fintype V] [LinearOrder V]
(Y : SimpleGraph V)
(hY : HasPlanarDrawingOn Y)
(hMax : forall Z : SimpleGraph V,
HasPlanarDrawingOn Z ->
(forall u v, Y.Adj u v -> Z.Adj u v) ->
forall u v, Z.Adj u v -> Y.Adj u v)
(hCard : 3 <= Fintype.card V) :
Y.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).