Planar edge-count upper bound
ProvedWilliamsonShmoys.planar_drawingOn_edgeSet_ncard_leA drawable finite simple graph on at least three vertices has at most 3|V|−6 edges, including when it is disconnected.
Preamble
import Mathlib import Definitions.Def_WilliamsonShmoys_PlanarDrawingOn
Formal statement
theorem WilliamsonShmoys.planar_drawingOn_edgeSet_ncard_le
{V : Type} [Fintype V] [LinearOrder V]
(J : SimpleGraph V)
(hDraw : WilliamsonShmoys.HasPlanarDrawingOn J)
(hCard : 3 ≤ Fintype.card V) :
J.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).