Edge bound for a connected planar drawing
ProvedWilliamsonShmoys.planarDrawing_connected_edge_upper_bound__p2m_82c54c31_7f79_42ee_8f08_de4d2157b6b0_a1approximation-algorithmsplanar-graphstreewidth
A finite connected simple graph with at least three vertices and a drawing satisfying HasPlanarDrawingOn has at most 3|V|−6 edges.
Preamble
import Mathlib import Definitions.Def_WilliamsonShmoys_PlanarDrawingOn set_option autoImplicit false open WilliamsonShmoys
Formal statement
theorem WilliamsonShmoys.planarDrawing_connected_edge_upper_bound__p2m_82c54c31_7f79_42ee_8f08_de4d2157b6b0_a1
{V : Type} [Fintype V] [LinearOrder V]
(K : SimpleGraph V)
(hK : HasPlanarDrawingOn K)
(hconn : K.Connected)
(hV : 3 ≤ Fintype.card V) :
K.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).