Edge count of a maximal planar drawing
ProvedWilliamsonShmoys.maximal_planar_drawing_edge_count_repair3approximation-algorithmsplanar-graphstreewidth
A drawable graph on at least three vertices with no drawable strict supergraph on the same vertex type has exactly 3|V| − 6 edges. The proof must show that maximality makes the plane embedding connected with triangular faces, then apply Euler’s formula. The lower bound on the number of vertices is explicit and prevents applying the planar maximal-edge formula outside its stated range.
Preamble
import Mathlib import Definitions.Def_WilliamsonShmoys_PlanarDrawingOn set_option autoImplicit false open WilliamsonShmoys
Formal statement
theorem WilliamsonShmoys.maximal_planar_drawing_edge_count_repair3
{V : Type} [Fintype V] [LinearOrder V]
(T : SimpleGraph V)
(hT : HasPlanarDrawingOn T)
(hCard : 3 ≤ Fintype.card V)
(hmax : ∀ U : SimpleGraph V,
HasPlanarDrawingOn U →
(∀ u v, T.Adj u v → U.Adj u v) →
(∀ u v, U.Adj u v → T.Adj u v)) :
T.edgeSet.ncard + 6 = 3 * Fintype.card V := 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).