Simple planar graph edge bound from Euler’s formula
ProvedWilliamsonShmoys.maximal_planar_edge_count_upper_bound_via_euler_a4779231approximation-algorithmsplanar-graphstreewidth
A finite simple graph with a crossing-free drawing and at least three vertices has at most 3|V| − 6 edges.
Preamble
import Definitions.Def_WilliamsonShmoys_PlanarDrawingOn set_option autoImplicit false
Formal statement
theorem WilliamsonShmoys.maximal_planar_edge_count_upper_bound_via_euler_a4779231
{V : Type} [Fintype V] [LinearOrder V]
(K : SimpleGraph V)
(hV : 3 <= Fintype.card V)
(hK : WilliamsonShmoys.HasPlanarDrawingOn K) :
K.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).