Simple planar edge bound
ProvedWilliamsonShmoys.crossing_free_drawing_edge_bound__p2m_85154c6b_7137_4d28_9cf8_ac3f60076d56_a2approximation-algorithmsplanar-graphstreewidth
A connected finite simple graph with at least three vertices and a crossing-free drawing has at most 3n − 6 edges. This isolates the edge-count bound from the parent. A proof route is to extend the drawing to a maximal planar simple graph, count each face boundary with length at least three, and combine the face-length count with Euler's formula; connectedness and the lower bound n ≥ 3 are retained for those steps. The remaining core obligation is proving the planar extension and face-boundary counts from the given drawing predicate.
Preamble
import Definitions.Def_WilliamsonShmoys_PlanarDrawingOn import Mathlib open WilliamsonShmoys
Formal statement
theorem WilliamsonShmoys.crossing_free_drawing_edge_bound__p2m_85154c6b_7137_4d28_9cf8_ac3f60076d56_a2
{V : Type} [Fintype V] [LinearOrder V]
(H : SimpleGraph V)
(hH : HasPlanarDrawingOn H)
(hconn : H.Connected)
(hcard : 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).