Planar drawing edge upper bound
ProvedWilliamsonShmoys.planar_drawing_edge_count_upper_bound__p2m_abcc1e5a_cabd_49d6_8da8_bf017a643b84_a1approximation-algorithmsplanar-graphstreewidth
Every simple graph with a drawing satisfying the supplied crossing-free arc predicate and at least three vertices has at most 3|V|−6 edges. The boundary case |V|=3 allows at most all three possible edges.
Preamble
import Definitions.Def_WilliamsonShmoys_PlanarDrawingOn set_option autoImplicit false
Formal statement
theorem WilliamsonShmoys.planar_drawing_edge_count_upper_bound__p2m_abcc1e5a_cabd_49d6_8da8_bf017a643b84_a1
{V : Type} [Fintype V] [LinearOrder V]
(L : SimpleGraph V)
(hcard : 3 ≤ Fintype.card V)
(hL : WilliamsonShmoys.HasPlanarDrawingOn L) :
L.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).