Edge upper bound for a drawable simple graph
ProvedWilliamsonShmoys.planar_graph_edge_upper_bound__p2m_ec284709_a18f_4c8c_aa4a_41fee9be8d7b_a1approximation-algorithmsplanar-graphstreewidth
Every drawable simple graph on at least three vertices has at most 3|V| − 6 edges. This isolates the Euler and face-degree argument from maximality.
Preamble
import Mathlib import Definitions.Def_WilliamsonShmoys_PlanarDrawingOn open WilliamsonShmoys
Formal statement
theorem WilliamsonShmoys.planar_graph_edge_upper_bound__p2m_ec284709_a18f_4c8c_aa4a_41fee9be8d7b_a1
{V : Type} [Fintype V] [LinearOrder V]
(K : SimpleGraph V)
(hK : WilliamsonShmoys.HasPlanarDrawingOn K)
(hCard : 3 <= Fintype.card V) :
K.edgeSet.ncard <= 3 * Fintype.card V - 6 := 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).