Exact edge count of a maximal drawable graph
ProvedWilliamsonShmoys.maximal_drawable_edge_count__p2m_773def43_51d0_4e88_9145_3374877c471c_a5approximation-algorithmsplanar-graphstreewidth
A maximal drawable simple graph on at least three vertices has edge count exactly 3|V|−6, expressed without subtraction. A proof route first establishes connectedness and triangular faces from maximality, then applies Euler’s formula and counts face-edge incidences. This isolates the main topological obligation; the parent uses the equality only after extending its graph to a maximal drawable supergraph.
Preamble
import Definitions.Def_WilliamsonShmoys_PlanarDrawingOn open WilliamsonShmoys
Formal statement
theorem WilliamsonShmoys.maximal_drawable_edge_count__p2m_773def43_51d0_4e88_9145_3374877c471c_a5
{V : Type} [Fintype V] [LinearOrder V]
(M : SimpleGraph V)
(hCard : 3 ≤ Fintype.card V)
(hDraw : WilliamsonShmoys.HasPlanarDrawingOn M)
(hMax : ∀ N : SimpleGraph V, M ≤ N → WilliamsonShmoys.HasPlanarDrawingOn N → N ≤ M) :
M.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).