Euler edge bound for maximal planar drawings
ProvedWilliamsonShmoys.maximal_planar_drawing_edge_bound_euler_v2approximation-algorithmsplanar-graphstreewidth
A connected, inclusion-maximal simple graph with a planar drawing and at least three vertices has at most three times its vertex count minus six edges.
Preamble
import Mathlib import Definitions.Def_WilliamsonShmoys_PlanarDrawingOn set_option autoImplicit false
Formal statement
theorem WilliamsonShmoys.maximal_planar_drawing_edge_bound_euler_v2
{V : Type} [Fintype V] [LinearOrder V]
(H : SimpleGraph V)
(hV : 3 <= Fintype.card V)
(hconn : H.Connected)
(hH : WilliamsonShmoys.HasPlanarDrawingOn H)
(hmax : ∀ H' : SimpleGraph V, H < H' →
¬ WilliamsonShmoys.HasPlanarDrawingOn H') :
H.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).