Edge bound for a connected simple planar graph
ProvedWilliamsonShmoys.connected_planar_edge_bound__p2m_1bec9fe1_f96d_4d95_8b96_08ac82faf267_a9approximation-algorithmsplanar-graphstreewidth
A connected simple graph on at least three vertices with the supplied noncrossing arc drawing has at most 3|V| − 6 edges. This isolates the Euler and face-boundary counting step; the tree case follows directly from its edge count.
Preamble
import Definitions.Def_WilliamsonShmoys_PlanarDrawingOn import Mathlib.Combinatorics.SimpleGraph.Basic import Mathlib.Combinatorics.SimpleGraph.Connectivity.Connected set_option autoImplicit false open WilliamsonShmoys
Formal statement
theorem WilliamsonShmoys.connected_planar_edge_bound__p2m_1bec9fe1_f96d_4d95_8b96_08ac82faf267_a9
{V : Type} [Fintype V] [LinearOrder V]
(M : SimpleGraph V) (hV : 3 <= Fintype.card V)
(hConn : M.Connected)
(hDraw : WilliamsonShmoys.HasPlanarDrawingOn M) :
(M.edgeSet.ncard : Int) <= 3 * (Fintype.card V : Int) - 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).