Edge count of a maximal drawable simple graph
ProvedWilliamsonShmoys.maximal_planar_drawing_exact_edge_count__p2m_718d0665_f14e_4e4a_9ebf_3d91778b5251_a1A drawable simple graph on at least three vertices that is maximal under drawable supergraph inclusion has exactly 3|V|−6 edges. The proof requires the planar-topology argument that a maximal planar drawing has triangular faces, followed by Euler's formula and face-edge counting.
Preamble
import Mathlib import Definitions.Def_WilliamsonShmoys_PlanarDrawingOn set_option autoImplicit false open WilliamsonShmoys
Formal statement
theorem WilliamsonShmoys.maximal_planar_drawing_exact_edge_count__p2m_718d0665_f14e_4e4a_9ebf_3d91778b5251_a1
{V : Type} [Fintype V] [LinearOrder V]
(N : SimpleGraph V)
(hV : 3 ≤ Fintype.card V)
(hN : WilliamsonShmoys.HasPlanarDrawingOn N)
(hmax : ∀ K : SimpleGraph V,
N ≤ K → WilliamsonShmoys.HasPlanarDrawingOn K → K ≤ N) :
3 * Fintype.card V - 6 = N.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).