Planar drawing edge-count upper bound
ProvedWilliamsonShmoys.planarDrawingOn_edge_count_upper_boundapproximation-algorithmsplanar-graphstreewidth
Every finite simple graph with the supplied crossing-free drawing and at least three vertices has at most 3|V|−6 edges. The independent proof route is Euler’s formula together with the fact that every face has boundary length at least three, with the standard component adjustment for disconnected graphs.
Preamble
import Mathlib import Definitions.Def_WilliamsonShmoys_PlanarDrawingOn
Formal statement
theorem WilliamsonShmoys.planarDrawingOn_edge_count_upper_bound
{V : Type} [Fintype V] [LinearOrder V]
(M : SimpleGraph V)
(hM : WilliamsonShmoys.HasPlanarDrawingOn M)
(hV : 3 ≤ Fintype.card V) :
M.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).