Edge bound for connected planar drawings
ProvedWilliamsonShmoys.planar_drawing_connected_edge_count_c7059b55_ff77_4f00_a57a_8983712db7a5approximation-algorithmsplanar-graphstreewidth
A connected finite simple graph with a crossing-free drawing and at least three vertices has at most three times its number of vertices minus six edges.
Preamble
import Mathlib import Definitions.Def_WilliamsonShmoys_PlanarDrawingOn set_option autoImplicit false open WilliamsonShmoys
Formal statement
theorem WilliamsonShmoys.planar_drawing_connected_edge_count_c7059b55_ff77_4f00_a57a_8983712db7a5
{V : Type} [Fintype V] [LinearOrder V]
(M : SimpleGraph V)
(hM : HasPlanarDrawingOn M)
(hconn : M.Connected)
(hV : 3 ≤ Fintype.card V) :
M.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).