Edge bound for a maximal drawable graph
ProvedWilliamsonShmoys.maximal_planar_edge_count_of_maximal__p2m_91c62409_832a_420e_9e29_0b556e5e78fe_a1approximation-algorithmsplanar-graphstreewidth
A drawable graph on at least three vertices that has no strictly larger drawable supergraph on the same vertex set has at least 3|V|−6 edges. The proof route turns its drawing into a plane embedding, uses maximality to establish triangular faces, then counts face-edge incidences together with Euler’s formula. This is the remaining core obligation.
Preamble
import Definitions.Def_WilliamsonShmoys_PlanarDrawingOn import Mathlib open WilliamsonShmoys set_option autoImplicit false
Formal statement
theorem WilliamsonShmoys.maximal_planar_edge_count_of_maximal__p2m_91c62409_832a_420e_9e29_0b556e5e78fe_a1 {V : Type} [Fintype V] [LinearOrder V] (U : SimpleGraph V) (hV : 3 ≤ Fintype.card V) (hU : WilliamsonShmoys.HasPlanarDrawingOn U) (hUmax : ∀ W : SimpleGraph V, U ≤ W → WilliamsonShmoys.HasPlanarDrawingOn W → W = U) : 3 * Fintype.card V - 6 ≤ U.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).