Edge count of a maximal drawable graph
ProvedWilliamsonShmoys.maximal_planar_edge_count_for_arcsapproximation-algorithmsplanar-graphstreewidth
A drawable graph on at least three vertices that is maximal among drawable supergraphs on the same vertex type has exactly three times the number of vertices minus six edges. The proof route is to establish the standard maximal-planar triangulation property from the drawing and maximality hypotheses, then use Euler's formula. This supplies the edge-count step in the parent.
Preamble
import Mathlib import Definitions.Def_WilliamsonShmoys_PlanarDrawingOn set_option autoImplicit false open WilliamsonShmoys
Formal statement
theorem WilliamsonShmoys.maximal_planar_edge_count_for_arcs
{V : Type} [Fintype V] [LinearOrder V]
(N : SimpleGraph V)
(hDrawing : WilliamsonShmoys.HasPlanarDrawingOn N)
(hCard : 3 ≤ Fintype.card V)
(hMaximal : ∀ K : SimpleGraph V,
N ≤ K → WilliamsonShmoys.HasPlanarDrawingOn K → K = N) :
N.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).