Planar edge bound for a drawable graph
ProvedWilliamsonShmoys.planar_edge_bound_for_maximal_edge_countapproximation-algorithmsplanar-graphstreewidth
A drawable simple graph on at least three vertices has at most three times its vertex count minus six edges. This is the usual Euler planar edge bound. Its proof route is to establish the face-count relation for a planar drawing, use that every face boundary has length at least three, and combine those facts with Euler’s formula. The strict lower-bound hypothesis on the vertex count is needed for the stated bound.
Preamble
import Mathlib import Definitions.Def_WilliamsonShmoys_PlanarDrawingOn set_option autoImplicit false open WilliamsonShmoys
Formal statement
theorem WilliamsonShmoys.planar_edge_bound_for_maximal_edge_count
{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).