Apply the connected planar edge estimate with small-component bounds
ProvedWilliamsonShmoys.connected_planar_edge_bound__p2m_b967a95f_e156_4a9a_acf3_4c05427be8a4_a2approximation-algorithmsplanar-graphstreewidth
Under the assumed connected planar edge estimate, a finite connected planar graph satisfies that estimate at size at least three, and has at most as many edges as vertices when its size is below three.
Preamble
import Definitions.Def_WilliamsonShmoys_PlanarDrawingOn import Mathlib set_option autoImplicit false open WilliamsonShmoys
Formal statement
theorem WilliamsonShmoys.connected_planar_edge_bound__p2m_b967a95f_e156_4a9a_acf3_4c05427be8a4_a2
{U : Type} [Fintype U] [LinearOrder U]
(hconnected : ∀ {W : Type} [Fintype W] [LinearOrder W]
(N : SimpleGraph W) (dN : DecidableRel N.Adj),
HasPlanarDrawingOn N → N.Connected → 3 ≤ Fintype.card W →
N.edgeFinset.card ≤ 3 * Fintype.card W - 6)
(N : SimpleGraph U) (dN : DecidableRel N.Adj)
(hN : HasPlanarDrawingOn N) (hc : N.Connected) :
(3 ≤ Fintype.card U → N.edgeFinset.card ≤ 3 * Fintype.card U - 6) ∧
(Fintype.card U < 3 → N.edgeFinset.card ≤ Fintype.card U) := 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).