Edge count of maximal drawable graphs
ProvedWilliamsonShmoys.maximal_planar_edge_count__p2m_65d0e573_2904_4a2f_b00a_11fd7ff50563_a1A drawable simple graph on at least three vertices that has no proper drawable supergraph on the same vertices has exactly 3n - 6 edges. The proof can pass from maximality to a connected plane embedding with triangular faces, then count edges using Euler’s formula and face-edge incidence.
Preamble
import Mathlib import Definitions.Def_WilliamsonShmoys_PlanarDrawingOn set_option autoImplicit false
Formal statement
theorem WilliamsonShmoys.maximal_planar_edge_count__p2m_65d0e573_2904_4a2f_b00a_11fd7ff50563_a1
{V : Type} [Fintype V] [LinearOrder V]
(Q : SimpleGraph V)
(hDraw : WilliamsonShmoys.HasPlanarDrawingOn Q)
(hMax : ∀ R : SimpleGraph V,
Q ≤ R → WilliamsonShmoys.HasPlanarDrawingOn R → R = Q)
(hCard : 3 ≤ Fintype.card V) :
Q.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).