Euler edge bound for a connected planar simple graph
ProvedWilliamsonShmoys.connected_planar_simple_graph_edge_count_upper_bound__p2m_eaa8e65f_484e_4122_a273_e383810a3b15_a2A connected simple graph with the supplied crossing-free drawing and at least three vertices has at most three times its vertex count minus six edges. Its independent proof route is to obtain the faces of the plane embedding, apply Euler’s formula, and count edge incidences around faces; simplicity and the vertex-count hypothesis rule out face boundaries of length below three.
Preamble
import Mathlib import Definitions.Def_WilliamsonShmoys_PlanarDrawingOn set_option autoImplicit false
Formal statement
theorem WilliamsonShmoys.connected_planar_simple_graph_edge_count_upper_bound__p2m_eaa8e65f_484e_4122_a273_e383810a3b15_a2
{V : Type} [Fintype V] [LinearOrder V] (H : SimpleGraph V)
(hH : WilliamsonShmoys.HasPlanarDrawingOn H)
(hConnected : H.Connected)
(hCard : 3 <= Fintype.card V) :
H.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).