Edge bound for a simple planar graph
ProvedWilliamsonShmoys.planar_edge_bound__p2m_c50fd7db_db60_4155_a74b_9f8219c920fe_a1approximation-algorithmsplanar-graphstreewidth
A finite simple graph on at least three vertices with the supplied crossing-free drawing has at most 3|V|−6 edges. This is the quantitative planar bound needed to prove the target’s face-incidence inequality. An independent proof route is to use facial boundary walks: their total length is twice the number of edges, each has length at least three under the simple-graph and size hypotheses, and Euler’s formula then yields the stated bound. Its remaining core is the same plane-embedding and facial-walk justification as the first child.
Preamble
import Mathlib import Definitions.Def_WilliamsonShmoys_PlanarDrawingOn open WilliamsonShmoys
Formal statement
theorem WilliamsonShmoys.planar_edge_bound__p2m_c50fd7db_db60_4155_a74b_9f8219c920fe_a1
{V : Type} [Fintype V] [LinearOrder V]
(H : SimpleGraph V)
(hPlanar : HasPlanarDrawingOn H)
(hV : 3 <= Fintype.card V) :
H.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).