Euler edge-count upper bound for a drawable graph
ProvedWilliamsonShmoys.planar_edge_count_upper_bound_3909e30c_a531_4010_a48d_ad4d6b0818e8approximation-algorithmsplanar-graphstreewidth
Every graph admitting the specified crossing-free drawing, on at least three vertices, has at most three times its vertex count minus six edges.
Preamble
import Mathlib import Definitions.Def_WilliamsonShmoys_PlanarDrawingOn set_option autoImplicit false
Formal statement
theorem WilliamsonShmoys.planar_edge_count_upper_bound_3909e30c_a531_4010_a48d_ad4d6b0818e8
{V : Type} [Fintype V] [LinearOrder V]
(J : SimpleGraph V)
(hV : 3 ≤ Fintype.card V)
(hJ : WilliamsonShmoys.HasPlanarDrawingOn 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).