The edge bound for connected planar graphs
ProvedWilliamsonShmoys.planar_edge_bound_connectedapproximation-algorithmsplanar-graphstreewidth
Every connected finite simple graph on at least three vertices with the stated crossing-free drawing has at most 3|V|−6 edges. This removes the connected case’s edge-count argument from the parent. A proof route is to extend the connected planar graph to a triangulated planar supergraph on the same vertices, then combine Euler’s formula with the fact that every face has boundary length at least three. The size hypothesis is essential for this face-count argument and matches the parent’s exact bound.
Preamble
import Mathlib import Definitions.Def_WilliamsonShmoys_PlanarDrawingOn set_option autoImplicit false
Formal statement
theorem WilliamsonShmoys.planar_edge_bound_connected
{V : Type} [Fintype V] [LinearOrder V]
(M : SimpleGraph V) (hV : 3 ≤ Fintype.card V)
(hconn : M.Connected)
(hM : WilliamsonShmoys.HasPlanarDrawingOn M) :
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).