Planar edge upper bound from a drawing
ProvedWilliamsonShmoys.edge_upper_bound_from_planar_drawing_repair_b095f50eapproximation-algorithmsplanar-graphstreewidth
A finite simple graph with at least three vertices and a crossing-free drawing has at most 3|V| − 6 edges. This supplies the target's upper inequality. A proof can use Euler's formula and face-edge incidence counting, with separate treatment of small components.
Preamble
import Definitions.Def_WilliamsonShmoys_PlanarDrawingOn set_option autoImplicit false
Formal statement
theorem WilliamsonShmoys.edge_upper_bound_from_planar_drawing_repair_b095f50e
{V : Type} [Fintype V] [LinearOrder V]
(W : SimpleGraph V)
(hV : 3 ≤ Fintype.card V)
(hW : WilliamsonShmoys.HasPlanarDrawingOn W) :
W.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).