Euler upper bound for a finite simple planar graph
ProvedWilliamsonShmoys.planar_edge_upper_bound__p2m_513f0e25_8b21_45bc_8db8_f06f4ba42a04_a1approximation-algorithmsplanar-graphstreewidth
Every graph satisfying the supplied crossing-free drawing predicate on at least three vertices has at most 3n−6 edges.
Preamble
import Definitions.Def_WilliamsonShmoys_PlanarDrawingOn open WilliamsonShmoys set_option autoImplicit false
Formal statement
theorem WilliamsonShmoys.planar_edge_upper_bound__p2m_513f0e25_8b21_45bc_8db8_f06f4ba42a04_a1
{V : Type} [Fintype V] [LinearOrder V]
(L : SimpleGraph V)
(hL : WilliamsonShmoys.HasPlanarDrawingOn L)
(hCard : 3 ≤ Fintype.card V) :
L.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).