Edge count of a maximal drawable graph
ProvedWilliamsonShmoys.maximal_planar_completion_maximal_edge_count__p2m_7f97800d_a064_49bc_abdc_383c926e2440_a1approximation-algorithmsplanar-graphstreewidth
A drawable finite simple graph that is maximal under drawable edge extensions has exactly 3|V|−6 edges when it has at least three vertices. This isolates the connectivity, face triangulation, and Euler-count argument from the construction of a maximal extension.
Preamble
import Definitions.Def_WilliamsonShmoys_PlanarDrawingOn import Mathlib set_option autoImplicit false open WilliamsonShmoys
Formal statement
theorem WilliamsonShmoys.maximal_planar_completion_maximal_edge_count__p2m_7f97800d_a064_49bc_abdc_383c926e2440_a1 {V : Type} [Fintype V] [LinearOrder V] (M : SimpleGraph V) (hMplanar : WilliamsonShmoys.HasPlanarDrawingOn M) (hmaximal : forall N : SimpleGraph V, LE.le M N -> WilliamsonShmoys.HasPlanarDrawingOn N -> N = M) (hV : 3 <= Fintype.card V) : M.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).