Edge count of a maximal drawable graph
ProvedWilliamsonShmoys.edge_count_eq_of_maximal_planar_729fc1e5approximation-algorithmsplanar-graphstreewidth
A drawable simple graph on at least three vertices that has no strict drawable supergraph on the same vertices has exactly 3|V|−6 edges. The proof requires showing maximality forces a triangulation and then applying the planar Euler edge count; this is the core topological obligation left for the child.
Preamble
import Mathlib import Definitions.Def_WilliamsonShmoys_PlanarDrawingOn set_option autoImplicit false
Formal statement
theorem WilliamsonShmoys.edge_count_eq_of_maximal_planar_729fc1e5
{V : Type} [Fintype V] [LinearOrder V]
(R : SimpleGraph V)
(hV : 3 ≤ Fintype.card V)
(hR : WilliamsonShmoys.HasPlanarDrawingOn R)
(hmax : ∀ S : SimpleGraph V, R ≤ S →
WilliamsonShmoys.HasPlanarDrawingOn S → S = R) :
R.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).