Edge-count bound for connected planar drawings
ProvedWilliamsonShmoys.planar_connected_drawing_edge_count_upper_bound_06232b3eapproximation-algorithmsplanar-graphstreewidth
A connected finite simple graph with a planar drawing and at least three vertices has at most 3|V|−6 edges. The three-vertex boundary is included; the triangle realizes equality. The independent proof route is Euler’s formula for the connected drawing and a count showing every face has at least three edge-sides. This child carries the main planar counting obligation left after augmentation.
Preamble
import Definitions.Def_WilliamsonShmoys_PlanarDrawingOn import Mathlib.Combinatorics.SimpleGraph.Connectivity.Connected set_option autoImplicit false open WilliamsonShmoys
Formal statement
theorem WilliamsonShmoys.planar_connected_drawing_edge_count_upper_bound_06232b3e
{V : Type} [Fintype V] [LinearOrder V]
(L : SimpleGraph V)
(hConnected : L.Connected)
(hDrawing : HasPlanarDrawingOn L)
(hCard : 3 ≤ Fintype.card V) :
L.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).