Planar drawing edge upper bound
ProvedWilliamsonShmoys.planar_drawing_edge_count_upper_bound__p2m_f2cfae8b_743a_4350_8c03_fa33aa7b455e_a1approximation-algorithmsplanar-graphstreewidth
Every drawable simple graph with at least three vertices has at most 3|V|−6 edges.
Preamble
import Definitions.Def_WilliamsonShmoys_PlanarDrawingOn import Mathlib open WilliamsonShmoys set_option autoImplicit false
Formal statement
theorem WilliamsonShmoys.planar_drawing_edge_count_upper_bound__p2m_f2cfae8b_743a_4350_8c03_fa33aa7b455e_a1 {V : Type} [Fintype V] [LinearOrder V] (K : SimpleGraph V) (hK : HasPlanarDrawingOn K) (hcard : 3 <= Fintype.card V) : (letI : DecidableRel K.Adj := Classical.decRel K.Adj; K.edgeFinset.card <= 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).