A maximal drawable graph has the triangulation edge count
ProvedWilliamsonShmoys.maximal_planar_supergraph_edge_count_9064c577_retry2A drawable simple graph on at least three vertices that has no strictly larger drawable supergraph on the same vertices has exactly 3n − 6 edges. The proof route formalizes the triangular-face property of maximal drawings and combines it with Euler’s formula.
Preamble
import Mathlib import Definitions.Def_WilliamsonShmoys_PlanarDrawingOn open WilliamsonShmoys set_option autoImplicit false
Formal statement
theorem WilliamsonShmoys.maximal_planar_supergraph_edge_count_9064c577_retry2
{V : Type} [Fintype V] [LinearOrder V]
(K : SimpleGraph V) (hDraw : HasPlanarDrawingOn K)
(hMax : ∀ L : SimpleGraph V, K ≤ L → HasPlanarDrawingOn L → L ≤ K)
(hCard : 3 ≤ Fintype.card V) :
K.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).