Count the edges of an edge-maximal planar graph
ProvedWilliamsonShmoys.maximal_planar_edge_count__p2m_43831d01_c2a2_47cc_baf7_12299ab7bdf8_a1approximation-algorithmsplanar-graphstreewidth
A planar graph on at least three vertices that is maximal among planar graphs on the same vertex set has exactly 3|V| − 6 edges.
Preamble
import Mathlib import Definitions.Def_WilliamsonShmoys_PlanarDrawingOn set_option autoImplicit false open WilliamsonShmoys
Formal statement
theorem WilliamsonShmoys.maximal_planar_edge_count__p2m_43831d01_c2a2_47cc_baf7_12299ab7bdf8_a1 {V : Type} [Fintype V] [LinearOrder V] (H : SimpleGraph V) (hH : HasPlanarDrawingOn H) (hV : 3 <= Fintype.card V) (hmax : ∀ J : SimpleGraph V, H <= J → HasPlanarDrawingOn J → J <= H) : 3 * Fintype.card V = H.edgeSet.ncard + 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).