An edge-maximal drawable graph has the triangulation edge count
ProvedWilliamsonShmoys.maximal_planar_drawing_has_euler_edge_count_38271ead_fcb7_486e_b3a1_3bd65c5883efapproximation-algorithmsplanar-graphstreewidth
A drawable simple graph on at least three vertices that has no strictly larger drawable supergraph has exactly 3|V|−6 edges. This removes the geometric triangulation and counting work from the parent. The lower bound is essential to the edge formula. A proof derives a planar embedding from the drawing, uses maximality to show every face is triangular, and applies Euler’s formula; for three vertices the maximal graph is the triangle.
Preamble
import Mathlib import Definitions.Def_WilliamsonShmoys_PlanarDrawingOn set_option autoImplicit false
Formal statement
theorem WilliamsonShmoys.maximal_planar_drawing_has_euler_edge_count_38271ead_fcb7_486e_b3a1_3bd65c5883ef
{V : Type} [Fintype V] [LinearOrder V]
(M : SimpleGraph V)
(hM : WilliamsonShmoys.HasPlanarDrawingOn M)
(hCard : 3 ≤ Fintype.card V)
(hMax : ∀ K : SimpleGraph V,
M ≤ K → WilliamsonShmoys.HasPlanarDrawingOn K → K ≤ M) :
(M.edgeSet.ncard : Int) = 3 * (Fintype.card V : Int) - 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).