Edge count of a maximal drawable simple graph
ProvedWilliamsonShmoys.maximal_planar_edge_count__p2m_10fbf93e_9f1f_430c_8d69_9a023f7a87fc_a1approximation-algorithmsplanar-graphstreewidth
A drawable simple graph with at least three vertices that has no proper drawable extension on the same vertex set has exactly 3|V|−6 edges. The proof route is to show maximality forces a triangulation, apply Euler’s formula and 3F = 2E, and use the at-least-three-vertices hypothesis in the planar topology argument.
Preamble
import Definitions.Def_WilliamsonShmoys_PlanarDrawingOn import Mathlib set_option autoImplicit false
Formal statement
theorem WilliamsonShmoys.maximal_planar_edge_count__p2m_10fbf93e_9f1f_430c_8d69_9a023f7a87fc_a1
{V : Type} [Fintype V] [LinearOrder V]
(N : SimpleGraph V) (dN : DecidableRel N.Adj)
(hN : WilliamsonShmoys.HasPlanarDrawingOn N)
(hcard : 3 <= Fintype.card V)
(hmax : ∀ (K : SimpleGraph V) (dK : DecidableRel K.Adj),
WilliamsonShmoys.HasPlanarDrawingOn K →
N.edgeFinset ⊆ K.edgeFinset →
K.edgeFinset ⊆ N.edgeFinset) :
N.edgeFinset.card = 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).