Edge count of a maximal drawable graph
ProvedWilliamsonShmoys.maximal_planar_has_euler_edge_count_8eefa310_d5a0_4ce6_aaa5_8cc496cd2f86approximation-algorithmsplanar-graphstreewidth
A drawable simple graph on at least three vertices that is maximal under drawable supergraph inclusion has exactly three times its vertex count minus six edges.
Preamble
import Mathlib import Definitions.Def_WilliamsonShmoys_PlanarDrawingOn set_option autoImplicit false
Formal statement
theorem WilliamsonShmoys.maximal_planar_has_euler_edge_count_8eefa310_d5a0_4ce6_aaa5_8cc496cd2f86
{V : Type} [Fintype V] [LinearOrder V]
(J : SimpleGraph V)
(hV : 3 ≤ Fintype.card V)
(hJ : WilliamsonShmoys.HasPlanarDrawingOn J)
(hmax : ∀ K : SimpleGraph V,
J ≤ K → WilliamsonShmoys.HasPlanarDrawingOn K → K = J) :
J.edgeSet.ncard = 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).