Euler edge bound for the supplied planar drawing predicate
ProvedWilliamsonShmoys.maximal_planar_edge_count_via_euler_planar_edge_upper_boundapproximation-algorithmsplanar-graphstreewidth
Any graph on at least three vertices with the supplied crossing-free drawing has at most 3|V|−6 edges. A proof route is to establish the plane graph Euler bound for each connected component and account for isolated vertices and disconnected components.
Preamble
import Definitions.Def_WilliamsonShmoys_PlanarDrawingOn set_option autoImplicit false
Formal statement
theorem WilliamsonShmoys.maximal_planar_edge_count_via_euler_planar_edge_upper_bound
{V : Type} [Fintype V] [LinearOrder V]
(S : SimpleGraph V)
(hV : 3 ≤ Fintype.card V)
(hSdraw : WilliamsonShmoys.HasPlanarDrawingOn S) :
S.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).