Simple planar drawing edge bound for walk-connected graphs
ProvedWilliamsonShmoys.planar_drawing_edge_upper_bound_of_connectedapproximation-algorithmsplanar-graphstreewidth
A finite simple graph with the specified crossing-free drawing and a walk between every pair of vertices has at most three times its number of vertices minus six edges, when it has at least three vertices. This isolates the connected planar edge bound.
Preamble
import Definitions.Def_WilliamsonShmoys_PlanarDrawingOn set_option autoImplicit false
Formal statement
theorem WilliamsonShmoys.planar_drawing_edge_upper_bound_of_connected
{V : Type} [Fintype V] [LinearOrder V]
(G : SimpleGraph V)
(hG : WilliamsonShmoys.HasPlanarDrawingOn G)
(hV : 3 ≤ Fintype.card V)
(hconn : ∀ u v : V, Nonempty (G.Walk u v)) :
G.edgeSet.ncard ≤ 3 * Fintype.card V - 6 := 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).