Planar simple graph edge-count upper bound
ProvedWilliamsonShmoys.planar_edge_count_upper_bound_35554814_repair3approximation-algorithmsplanar-graphstreewidth
Every drawable simple graph on at least three vertices has at most 3|V| − 6 edges. Derive a planar embedding from the arc drawing, connect components in the plane if needed, and apply Euler’s formula and face-edge incidence counting. This isolates the general upper-bound argument from maximality.
Preamble
import Mathlib import Definitions.Def_WilliamsonShmoys_PlanarDrawingOn set_option autoImplicit false open WilliamsonShmoys
Formal statement
theorem WilliamsonShmoys.planar_edge_count_upper_bound_35554814_repair3
{V : Type} [Fintype V] [LinearOrder V]
(P : SimpleGraph V)
(hCard : 3 ≤ Fintype.card V)
(hP : WilliamsonShmoys.HasPlanarDrawingOn P) :
P.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).