Planar simple graph edge upper bound
ProvedWilliamsonShmoys.planar_simple_graph_edge_count_upper__p2m_a57dc3db_20ea_40d3_9b0f_dcd4c88e6cc2_a1A finite simple graph with a crossing-free drawing and at least three vertices has at most 3n − 6 edges.
Preamble
import Mathlib import Definitions.Def_WilliamsonShmoys_PlanarDrawingOn open WilliamsonShmoys set_option autoImplicit false
Formal statement
theorem WilliamsonShmoys.planar_simple_graph_edge_count_upper__p2m_a57dc3db_20ea_40d3_9b0f_dcd4c88e6cc2_a1
{V : Type} [Fintype V] [LinearOrder V]
(L : SimpleGraph V)
(hDraw : 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).