Edge bound for a finite planar drawing
ProvedWilliamsonShmoys.maximalPlanar_edge_count_upper_bound__p2m_12371c70_d6b7_41aa_8516_3639658d867c_a2approximation-algorithmsplanar-graphstreewidth
A finite simple graph with a crossing-free drawing and at least three vertices has at most 3n − 6 edges.
Preamble
import Mathlib import Definitions.Def_WilliamsonShmoys_PlanarDrawingOn
Formal statement
theorem WilliamsonShmoys.maximalPlanar_edge_count_upper_bound__p2m_12371c70_d6b7_41aa_8516_3639658d867c_a2
{V : Type} [Fintype V] [LinearOrder V]
(N : SimpleGraph V)
(hN : WilliamsonShmoys.HasPlanarDrawingOn N)
(hCard : 3 ≤ Fintype.card V) :
N.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).