Euler edge bound for connected planar graphs
ProvedWilliamsonShmoys.connected_planar_edge_bound__p2m_4dfbc005_ec61_47aa_85e1_1f450847f914_a4approximation-algorithmsplanar-graphstreewidth
A connected simple graph with at least three vertices and the supplied planar drawing satisfies the Euler edge bound.
Preamble
import Definitions.Def_WilliamsonShmoys_PlanarDrawingOn import Mathlib.Combinatorics.SimpleGraph.Connectivity.Connected set_option autoImplicit false
Formal statement
theorem WilliamsonShmoys.connected_planar_edge_bound__p2m_4dfbc005_ec61_47aa_85e1_1f450847f914_a4
{V : Type} [Fintype V] [LinearOrder V]
(M : SimpleGraph V)
(hcard : 3 ≤ Fintype.card V)
(hconn : M.Connected)
(hM : WilliamsonShmoys.HasPlanarDrawingOn M) :
M.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).