An inclusion-maximal drawable graph has the triangulation edge count
ProvedWilliamsonShmoys.planar_drawing_has_triangulation_supergraph_edge_count_maximal_countapproximation-algorithmsplanar-graphstreewidth
If a drawable simple graph on at least three vertices is maximal among drawable supergraphs on the same vertex type, then it has exactly 3|V| − 6 edges. The proof must establish the triangulation properties forced by maximality and apply Euler’s formula.
Preamble
import Definitions.Def_WilliamsonShmoys_PlanarDrawingOn import Mathlib.Combinatorics.SimpleGraph.Basic
Formal statement
theorem WilliamsonShmoys.planar_drawing_has_triangulation_supergraph_edge_count_maximal_count
{V : Type} [Fintype V] [LinearOrder V]
(M : SimpleGraph V) (hV : 3 <= Fintype.card V)
(hM : WilliamsonShmoys.HasPlanarDrawingOn M)
(hmax : forall 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).