Edge count of a maximal drawable graph
ProvedWilliamsonShmoys.maximal_planar_edge_count_ec05fb32_d087_4cea_a2cd_8a3ca91ed513approximation-algorithmsplanar-graphstreewidth
A drawable simple graph on at least three vertices with no strictly larger drawable supergraph on the same vertex set has exactly 3|V| − 6 edges. The independent proof route is to formalize that maximality forces a connected triangulated plane embedding, then apply Euler’s formula and count each edge twice among triangular face boundaries. At three vertices, maximality forces K₃, which satisfies the same equality.
Preamble
import Mathlib import Definitions.Def_WilliamsonShmoys_PlanarDrawingOn
Formal statement
theorem WilliamsonShmoys.maximal_planar_edge_count_ec05fb32_d087_4cea_a2cd_8a3ca91ed513
{V : Type} [Fintype V] [LinearOrder V]
(N : SimpleGraph V)
(hV : 3 <= Fintype.card V)
(hN : WilliamsonShmoys.HasPlanarDrawingOn N)
(hmax : ∀ K : SimpleGraph V, N ≤ K → WilliamsonShmoys.HasPlanarDrawingOn K → K = N) :
3 * Fintype.card V = N.edgeSet.ncard + 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).