Edge count of a maximal drawable graph
ProvedWilliamsonShmoys.maximal_planar_drawing_maximal_edge_count_20261028approximation-algorithmsplanar-graphstreewidth
A drawable graph on at least three vertices that has no strictly larger drawable supergraph has exactly 3|V|−6 edges. This supplies the geometric and counting step needed after maximal extension. A proof route is to obtain a plane embedding from the given drawing, show that any face with more than three boundary edges permits adding an edge inside that face, conclude every face is triangular, and combine the triangular face count with Euler’s formula. Check the three-vertex case explicitly in the argument. This is the remaining core obligation; the continuous-arc drawing definition makes deriving and formalizing the embedding and face facts substantial work.
Preamble
import Mathlib import Definitions.Def_WilliamsonShmoys_PlanarDrawingOn set_option autoImplicit false
Formal statement
theorem WilliamsonShmoys.maximal_planar_drawing_maximal_edge_count_20261028
{V : Type} [Fintype V] [LinearOrder V]
(K : SimpleGraph V)
(hK : WilliamsonShmoys.HasPlanarDrawingOn K)
(hCard : 3 ≤ Fintype.card V)
(hmax : ∀ L : SimpleGraph V, K ≤ L → WilliamsonShmoys.HasPlanarDrawingOn L → L ≤ K) :
(K.edgeSet.ncard : Int) = 3 * (Fintype.card V : Int) - 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).