Edge bound for a finite planar drawing
ProvedWilliamsonShmoys.planar_drawing_edge_count_upper_219c2427_f0ca_410a_8cab_2194ee3f8b9capproximation-algorithmsplanar-graphstreewidth
A finite graph with a crossing-free drawing and at least three vertices has at most 3|V|−6 edges.
Preamble
import Definitions.Def_WilliamsonShmoys_PlanarDrawingOn open WilliamsonShmoys
Formal statement
theorem WilliamsonShmoys.planar_drawing_edge_count_upper_219c2427_f0ca_410a_8cab_2194ee3f8b9c
{V : Type} [Fintype V] [LinearOrder V]
(K : SimpleGraph V) (hK : WilliamsonShmoys.HasPlanarDrawingOn K)
(hCard : 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).