Edge upper bound for a planar drawing
ProvedWilliamsonShmoys.planar_drawing_edge_count_upper_bound_8742a5e4_f287_4b84_b71a_f78e094dd85capproximation-algorithmsplanar-graphstreewidth
Every drawable simple graph on at least three finite ordered vertices has at most 3n−6 edges. This supplies the upper bound in the target.
Preamble
import Definitions.Def_WilliamsonShmoys_PlanarDrawingOn set_option autoImplicit false
Formal statement
theorem WilliamsonShmoys.planar_drawing_edge_count_upper_bound_8742a5e4_f287_4b84_b71a_f78e094dd85c
{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).