Euler edge count for a maximal drawable graph
ProvedWilliamsonShmoys.edge_maximal_planar_drawing_has_euler_edge_count_v2approximation-algorithmsplanar-graphstreewidth
A drawable simple graph on at least three vertices with no proper drawable supergraph on the same vertices has exactly 3|V|−6 edges.
Preamble
import Definitions.Def_WilliamsonShmoys_PlanarDrawingOn set_option autoImplicit false
Formal statement
theorem WilliamsonShmoys.edge_maximal_planar_drawing_has_euler_edge_count_v2
{V : Type} [Fintype V] [LinearOrder V]
(L : SimpleGraph V)
(hL : WilliamsonShmoys.HasPlanarDrawingOn L)
(hmax : ∀ M : SimpleGraph V, L ≤ M → WilliamsonShmoys.HasPlanarDrawingOn M → M = L)
(hV : 3 ≤ Fintype.card V) :
L.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).