A maximal graph for the continuous-arc drawing predicate has the planar maximum edge count
ProvedWilliamsonShmoys.maximal_drawable_graph_edge_count_from_arcs_6a5dd28fapproximation-algorithmsplanar-graphstreewidth
An inclusion-maximal graph with a crossing-free continuous-arc drawing on a finite linearly ordered vertex type with at least three vertices has exactly 3|V|−6 edges.
Preamble
import Mathlib import Definitions.Def_WilliamsonShmoys_PlanarDrawingOn set_option autoImplicit false
Formal statement
theorem WilliamsonShmoys.maximal_drawable_graph_edge_count_from_arcs_6a5dd28f {V : Type} [Fintype V] [LinearOrder V] (M : SimpleGraph V) (hV : 3 <= Fintype.card V) (hM : WilliamsonShmoys.HasPlanarDrawingOn M) (hmax : forall N : SimpleGraph V, M <= N -> WilliamsonShmoys.HasPlanarDrawingOn N -> N = M) : M.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).