Drawable graph planar edge-count upper bound
ProvedWilliamsonShmoys.planar_graph_edge_count_upper_bound_dabb2cbe_7fe3_4213_96ba_204afbbd922bapproximation-algorithmsplanar-graphstreewidth
Every graph admitting the specified planar drawing, with at least three vertices, has at most 3|V| − 6 edges. Connect planar components if needed, then use Euler’s formula and face-edge incidence counting.
Preamble
import Definitions.Def_WilliamsonShmoys_PlanarDrawingOn set_option autoImplicit false
Formal statement
theorem WilliamsonShmoys.planar_graph_edge_count_upper_bound_dabb2cbe_7fe3_4213_96ba_204afbbd922b
{V : Type} [Fintype V] [LinearOrder V]
(Y : SimpleGraph V)
(hV : 3 ≤ Fintype.card V)
(hY : WilliamsonShmoys.HasPlanarDrawingOn Y) :
Y.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).