Planar edge-count upper bound for a finite drawing
ProvedWilliamsonShmoys.planar_edge_count_upper_bound_retry7_f81c96b6_b51d_4165_8b99_52e367cbc589approximation-algorithmsplanar-graphstreewidth
A graph on at least three vertices with the specified crossing-free drawing has at most 3|V| - 6 edges, whether or not it is connected. This removes the edge-count upper-bound argument from the parent. A proof route is to establish Euler’s formula and the face-degree bound for each component, then combine the component bounds while preserving the stated |V| ≥ 3 condition.
Preamble
import Mathlib import Definitions.Def_WilliamsonShmoys_PlanarDrawingOn set_option autoImplicit false
Formal statement
theorem WilliamsonShmoys.planar_edge_count_upper_bound_retry7_f81c96b6_b51d_4165_8b99_52e367cbc589
{V : Type} [Fintype V] [LinearOrder V]
(H : SimpleGraph V)
(hV : 3 ≤ Fintype.card V)
(hH : WilliamsonShmoys.HasPlanarDrawingOn H) :
H.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).