A maximal graph with a planar arc drawing has 3n−6 edges
ProvedWilliamsonShmoys.maximal_planar_drawing_edge_count_from_arcsapproximation-algorithmsplanar-graphstreewidth
A finite simple graph with at least three vertices that has the supplied planar arc drawing and is maximal among planar graphs on those vertices has exactly three times its number of vertices minus six edges.
Preamble
import Mathlib import Definitions.Def_WilliamsonShmoys_PlanarDrawingOn set_option autoImplicit false
Formal statement
theorem WilliamsonShmoys.maximal_planar_drawing_edge_count_from_arcs
{V : Type} [Fintype V] [LinearOrder V]
(K : SimpleGraph V)
(hK : WilliamsonShmoys.HasPlanarDrawingOn K)
(hmax : ∀ L : SimpleGraph V, K ≤ L →
WilliamsonShmoys.HasPlanarDrawingOn L → L = K)
(hV : 3 ≤ Fintype.card V) :
K.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).