Euler upper bound for drawable simple graphs
ProvedWilliamsonShmoys.planar_edge_count_upper_bound_b5197173approximation-algorithmsplanar-graphstreewidth
Every graph satisfying the supplied crossing-free drawing predicate, on at least three vertices, has at most 3n - 6 edges.
Preamble
import Mathlib import Definitions.Def_WilliamsonShmoys_PlanarDrawingOn set_option autoImplicit false
Formal statement
theorem WilliamsonShmoys.planar_edge_count_upper_bound_b5197173
{V : Type} [Fintype V] [LinearOrder V]
(M : SimpleGraph V) (hV : 3 <= Fintype.card V)
(hM : WilliamsonShmoys.HasPlanarDrawingOn M) :
M.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).