Edge-count bound for a connected planar drawing
ProvedWilliamsonShmoys.planar_connected_drawing_edge_count_upper_bound_06232b3e__p2m_2a9dccf6_668c_4d19_9019_ad95792f6898_a3approximation-algorithmsplanar-graphstreewidth
A connected finite simple graph with a planar drawing and at least three vertices has at most 3|V|−6 edges. The independent proof route is to derive Euler's formula for the drawing and count at least three edge-sides on each face boundary. This child carries the connected 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__p2m_2a9dccf6_668c_4d19_9019_ad95792f6898_a3
{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).