Planar simple graph edge upper bound
ProvedWilliamsonShmoys.planar_edge_count_upper_bound__p2m_d113e12d_71ad_41a3_b6a2_eff564f35d28_a1approximation-algorithmsplanar-graphstreewidth
Any finite simple graph with at least three vertices that has the specified crossing-free drawing has at most 3|V|−6 edges. This is the Euler-formula upper bound, independent of maximality.
Preamble
import Mathlib import Definitions.Def_WilliamsonShmoys_PlanarDrawingOn set_option autoImplicit false
Formal statement
theorem WilliamsonShmoys.planar_edge_count_upper_bound__p2m_d113e12d_71ad_41a3_b6a2_eff564f35d28_a1 {V : Type} [Fintype V] [LinearOrder V] (Q : SimpleGraph V) (hV : 3 ≤ Fintype.card V) (hDraw : WilliamsonShmoys.HasPlanarDrawingOn Q) : Q.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).