Edge count of a maximal drawable graph
ProvedWilliamsonShmoys.maximal_planar_graph_edge_count_dabb2cbe_7fe3_4213_96ba_204afbbd922bapproximation-algorithmsplanar-graphstreewidth
An inclusion-maximal drawable simple graph on at least three vertices has exactly 3|V| − 6 edges. The proof must establish that maximality forces a triangulation, then use Euler’s formula and count face-edge incidences; the three-vertex boundary case is K₃.
Preamble
import Definitions.Def_WilliamsonShmoys_PlanarDrawingOn set_option autoImplicit false
Formal statement
theorem WilliamsonShmoys.maximal_planar_graph_edge_count_dabb2cbe_7fe3_4213_96ba_204afbbd922b
{V : Type} [Fintype V] [LinearOrder V]
(Y : SimpleGraph V)
(hV : 3 ≤ Fintype.card V)
(hY : WilliamsonShmoys.HasPlanarDrawingOn Y)
(hmax : ∀ Z : SimpleGraph V,
Y ≤ Z → WilliamsonShmoys.HasPlanarDrawingOn Z → Z = Y) :
3 * Fintype.card V = Y.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).