Edge count of a maximal planar drawing
ProvedWilliamsonShmoys.maximal_planar_drawing_edge_count__p2m_bb4dce47_9275_45c5_899b_6355cecbb075_a5A connected graph on at least three vertices that is maximal among drawable supergraphs on that vertex set has exactly 3|V|−6 edges. This isolates the planar-topology step: show maximality forces triangular faces, then apply Euler’s formula to the resulting finite plane embedding. The parent uses this together with the finite maximal-extension result to obtain the target.
Preamble
import Mathlib import Definitions.Def_WilliamsonShmoys_PlanarDrawingOn set_option autoImplicit false
Formal statement
theorem WilliamsonShmoys.maximal_planar_drawing_edge_count__p2m_bb4dce47_9275_45c5_899b_6355cecbb075_a5
{V : Type} [Fintype V] [LinearOrder V]
(H : SimpleGraph V)
(hconn : H.Connected)
(hdraw : WilliamsonShmoys.HasPlanarDrawingOn H)
(hCard : 3 ≤ Fintype.card V)
(hmax : ∀ K : SimpleGraph V, H ≤ K → WilliamsonShmoys.HasPlanarDrawingOn K → K = H) :
H.edgeSet.ncard + 6 = 3 * Fintype.card V := 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).