Edge count of an edge-maximal drawable graph
ProvedWilliamsonShmoys.edge_maximal_drawable_graph_edge_countapproximation-algorithmsplanar-graphstreewidth
An edge-maximal drawable simple graph on at least three vertices has exactly 3|V|−6 edges. The boundary case |V| = 3 gives three edges. A proof route is to interpret the supplied drawing as a plane embedding, show maximality forces every face to be triangular (including by adding edges between components or across a nontriangular face when possible), and count incidences between faces and edges. Euler’s formula then gives the claimed edge count. This removes the entire planar counting step from the parent; the main remaining obligation is deriving the needed embedding and face properties from HasPlanarDrawingOn and its exact maximality hypothesis.
Preamble
import Mathlib import Definitions.Def_WilliamsonShmoys_PlanarDrawingOn set_option autoImplicit false
Formal statement
theorem WilliamsonShmoys.edge_maximal_drawable_graph_edge_count
{V : Type} [Fintype V] [LinearOrder V]
(U : SimpleGraph V)
(hdraw : WilliamsonShmoys.HasPlanarDrawingOn U)
(hV : 3 <= Fintype.card V)
(hmax : ∀ W : SimpleGraph V,
(∀ {u v}, U.Adj u v → W.Adj u v) →
WilliamsonShmoys.HasPlanarDrawingOn W → W = U) :
U.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).