Planar edge upper bound for triangulation extension
ProvedWilliamsonShmoys.planar_edge_count_upper_bound_for_triangulation_extension_v2_0463fea4approximation-algorithmsplanar-graphstreewidth
Every drawable finite simple graph with at least three vertices has at most 3|V| - 6 edges.
Preamble
import Mathlib import Definitions.Def_WilliamsonShmoys_PlanarDrawingOn set_option autoImplicit false open WilliamsonShmoys
Formal statement
theorem WilliamsonShmoys.planar_edge_count_upper_bound_for_triangulation_extension_v2_0463fea4
{V : Type} [Fintype V] [LinearOrder V]
(R : SimpleGraph V)
(hCard : 3 <= Fintype.card V)
(hR : WilliamsonShmoys.HasPlanarDrawingOn R) :
R.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).