Planar simple graphs satisfy the Euler edge bound
ProvedWilliamsonShmoys.planar_edge_count_upper_bound_e5c3d806_69b9_4602_a0f9_34c482daacc9approximation-algorithmsplanar-graphstreewidth
Every drawable simple graph with 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_e5c3d806_69b9_4602_a0f9_34c482daacc9
{V : Type} [Fintype V] [LinearOrder V]
(Z : SimpleGraph V)
(hZ : WilliamsonShmoys.HasPlanarDrawingOn Z)
(hV : 3 ≤ Fintype.card V) :
Z.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).