Edge count of an edge-maximal planar graph
ProvedWilliamsonShmoys.edgeMaximal_planar_edge_count_5fac830d_330a_4033_b92d_b2d1f0f7b487approximation-algorithmsplanar-graphstreewidth
An edge-maximal simple graph admitting the stated drawing on at least three vertices has exactly three times the vertex count minus six edges.
Preamble
import Mathlib import Definitions.Def_WilliamsonShmoys_PlanarDrawingOn set_option autoImplicit false
Formal statement
theorem WilliamsonShmoys.edgeMaximal_planar_edge_count_5fac830d_330a_4033_b92d_b2d1f0f7b487
{V : Type} [Fintype V] [LinearOrder V]
(M : SimpleGraph V)
(hV : 3 <= Fintype.card V)
(hM : WilliamsonShmoys.HasPlanarDrawingOn M)
(hMax : ∀ K : SimpleGraph V,
M ≤ K → WilliamsonShmoys.HasPlanarDrawingOn K → K ≤ M) :
M.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).