Maximal drawable graphs have enough edges
ProvedWilliamsonShmoys.maximal_drawable_simple_graph_edge_count_lower_boundapproximation-algorithmsplanar-graphstreewidth
An inclusion-maximal graph with the specified crossing-free drawing and at least three vertices has at least 3|V|−6 edges. A proof route derives an embedding, establishes that maximality forces triangular faces, and combines face-edge incidence counting with Euler’s formula.
Preamble
import Mathlib import Definitions.Def_WilliamsonShmoys_PlanarDrawingOn set_option autoImplicit false
Formal statement
theorem WilliamsonShmoys.maximal_drawable_simple_graph_edge_count_lower_bound
{V : Type} [Fintype V] [LinearOrder V]
(G : SimpleGraph V)
(hV : 3 ≤ Fintype.card V)
(hG : WilliamsonShmoys.HasPlanarDrawingOn G)
(hMax : ∀ U : SimpleGraph V,
G ≤ U → WilliamsonShmoys.HasPlanarDrawingOn U → U = G) :
3 * Fintype.card V - 6 ≤ G.edgeSet.ncard := 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).