Edge bound for planar graphs of minimum degree two
ProvedWilliamsonShmoys.planar_min_degree_two_edge_bound__p2m_5d9b8ff2_1349_4ea9_a2d4_f406c9d22c5b_a1approximation-algorithmsplanar-graphstreewidth
A connected simple graph with a crossing-free drawing, at least three vertices, and at least two neighbors at every vertex has at most three times its vertex count minus six edges.
Preamble
import Definitions.Def_WilliamsonShmoys_PlanarDrawingOn import Mathlib open WilliamsonShmoys set_option autoImplicit false
Formal statement
theorem WilliamsonShmoys.planar_min_degree_two_edge_bound__p2m_5d9b8ff2_1349_4ea9_a2d4_f406c9d22c5b_a1
{V : Type} [Fintype V] [LinearOrder V]
(K : SimpleGraph V)
(hK : HasPlanarDrawingOn K)
(hconn : K.Connected)
(hcard : 3 <= Fintype.card V)
(hdegree : ∀ v : V, 2 <= (K.neighborSet v).ncard) :
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).