Edge bound for connected planar graphs
ProvedWilliamsonShmoys.connected_planar_edge_bound_repair__p2m_21446003_fac0_46fd_be6f_03d17c7cc1aa_a4approximation-algorithmsplanar-graphstreewidth
Prove the standard edge bound for a finite connected simple graph with a crossing-free drawing and at least three vertices. This isolates the Euler-formula argument and the face-boundary estimates, including exceptional short-face cases.
Preamble
import Definitions.Def_WilliamsonShmoys_PlanarDrawingOn set_option autoImplicit false
Formal statement
theorem WilliamsonShmoys.connected_planar_edge_bound_repair__p2m_21446003_fac0_46fd_be6f_03d17c7cc1aa_a4
{V : Type} [Fintype V] [LinearOrder V]
(G : SimpleGraph V)
(hV : 3 ≤ Fintype.card V)
(hconn : ∀ u v, Relation.ReflTransGen G.Adj u v)
(hG : WilliamsonShmoys.HasPlanarDrawingOn G) :
G.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).