Edge bound for a connected graph with a crossing-free drawing
ProvedWilliamsonShmoys.planar_simple_graph_edge_bound_connected__p2m_5db6a80d_54aa_4e0a_9bf3_96c293216517_a1approximation-algorithmsplanar-graphstreewidth
A connected finite simple graph with at least three vertices and a drawing satisfying the supplied crossing-free predicate has at most 3|V| − 6 edges.
Preamble
import Mathlib import Definitions.Def_WilliamsonShmoys_PlanarDrawingOn set_option autoImplicit false namespace WilliamsonShmoys end WilliamsonShmoys
Formal statement
theorem WilliamsonShmoys.planar_simple_graph_edge_bound_connected__p2m_5db6a80d_54aa_4e0a_9bf3_96c293216517_a1 {V : Type} [Fintype V] [LinearOrder V] (H : SimpleGraph V) (hH : WilliamsonShmoys.HasPlanarDrawingOn H) (hconn : H.Connected) (hcard : 3 ≤ Fintype.card V) : H.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).