Planar edge bound for connected drawings
ProvedWilliamsonShmoys.edge_count_le_of_connected_planar_drawingapproximation-algorithmsplanar-graphstreewidth
A connected graph with a crossing-free drawing on at least three vertices has at most 3n − 6 edges. This contains the main topological work. A proof route is to extend the embedding to a triangulation without adding vertices, apply Euler’s formula and count face-edge incidences; the triangulation step handles bridges and faces whose original boundary walks are short.
Preamble
import Mathlib import Definitions.Def_WilliamsonShmoys_PlanarDrawingOn set_option autoImplicit false
Formal statement
theorem WilliamsonShmoys.edge_count_le_of_connected_planar_drawing
{V : Type} [Fintype V] [LinearOrder V]
(G : SimpleGraph V)
(hV : 3 ≤ Fintype.card V)
(hdraw : WilliamsonShmoys.HasPlanarDrawingOn G)
(hconn : G.Connected) :
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).