Edge bound for a planar drawing
ProvedWilliamsonShmoys.planar_drawing_edge_bound_79011c86fe2a4d17approximation-algorithmsplanar-graphstreewidth
Every graph with a drawing satisfying HasPlanarDrawingOn and at least three vertices has at most 3|V|−6 edges.
Preamble
import Mathlib import Definitions.Def_WilliamsonShmoys_PlanarDrawingOn set_option autoImplicit false
Formal statement
theorem WilliamsonShmoys.planar_drawing_edge_bound_79011c86fe2a4d17
{V : Type} [Fintype V] [LinearOrder V]
(N : SimpleGraph V) (hV : 3 <= Fintype.card V)
(hN : WilliamsonShmoys.HasPlanarDrawingOn N) :
N.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).