Edge bound for a connected graph with a planar drawing
ProvedWilliamsonShmoys.connected_planar_edge_bound_b095f50eapproximation-algorithmsplanar-graphstreewidth
A connected finite simple graph on at least three vertices with the supplied crossing-free drawing has at most three times its vertex count minus six edges. The source-backed route is to pass from the drawing to a spherical embedding, apply Euler’s formula, and count at least three edge incidences per face. The size hypothesis excludes the small connected graphs where this bound does not hold. Formalizing that topological route is the remaining core obligation.
Preamble
import Definitions.Def_WilliamsonShmoys_PlanarDrawingOn import Mathlib.Combinatorics.SimpleGraph.Connectivity.Connected
Formal statement
theorem WilliamsonShmoys.connected_planar_edge_bound_b095f50e
{V : Type} [Fintype V] [LinearOrder V]
(G : SimpleGraph V)
(hV : 3 ≤ Fintype.card V)
(hConnected : G.Connected)
(hDrawing : WilliamsonShmoys.HasPlanarDrawingOn G) :
G.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).