Planar drawing edge count upper bound
ProvedWilliamsonShmoys.planar_drawing_edge_count_upper__p2m_fe266be1_b394_4319_ae10_b52cb17a5e91_a1approximation-algorithmsplanar-graphstreewidth
Any graph with the supplied planar drawing on at least three vertices has at most 3 * |V| - 6 edges. This removes the upper-bound half of the target. Prove it by connecting components in the planar drawing as needed, applying Euler's formula, and bounding face edge incidences; handle exceptional small or disconnected cases under the exact |V| ≥ 3 assumption.
Preamble
import Mathlib import Definitions.Def_WilliamsonShmoys_PlanarDrawingOn set_option autoImplicit false open WilliamsonShmoys
Formal statement
theorem WilliamsonShmoys.planar_drawing_edge_count_upper__p2m_fe266be1_b394_4319_ae10_b52cb17a5e91_a1
{V : Type} [Fintype V] [LinearOrder V]
(M : SimpleGraph V)
(hM : WilliamsonShmoys.HasPlanarDrawingOn M)
(hCard : 3 ≤ Fintype.card V) :
M.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).