Euler upper bound for planar edge count
ProvedWilliamsonShmoys.planar_edge_count_upper_bound__p2m_8532617a_0690_495a_a2cc_fdaf4080cf05_a1approximation-algorithmsplanar-graphstreewidth
A finite simple graph with a planar drawing and at least three vertices has at most 3|V|−6 edges. This is the Euler edge bound; it can be proved by treating connected components, applying Euler's formula to a connected plane graph, and using that each face boundary has length at least three in a simple graph.
Preamble
import Definitions.Def_WilliamsonShmoys_PlanarDrawingOn
Formal statement
theorem WilliamsonShmoys.planar_edge_count_upper_bound__p2m_8532617a_0690_495a_a2cc_fdaf4080cf05_a1
{V : Type} [Fintype V] [LinearOrder V]
(G : SimpleGraph V)
(hG : WilliamsonShmoys.HasPlanarDrawingOn G)
(hcard : 3 ≤ Fintype.card V) :
G.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).