Edge count of a maximal drawable graph
ProvedWilliamsonShmoys.maximal_drawable_graph_has_exact_euler_edge_countapproximation-algorithmsplanar-graphstreewidth
A drawable simple graph on at least three vertices that admits no drawable edge-supergraph on the same vertex set has exactly three times the number of vertices minus six edges.
Preamble
import Definitions.Def_WilliamsonShmoys_PlanarDrawingOn set_option autoImplicit false
Formal statement
theorem WilliamsonShmoys.maximal_drawable_graph_has_exact_euler_edge_count
{V : Type} [Fintype V] [LinearOrder V]
(K : SimpleGraph V)
(hV : 3 ≤ Fintype.card V)
(hK : WilliamsonShmoys.HasPlanarDrawingOn K)
(hmax : ∀ L : SimpleGraph V, K.edgeSet ⊆ L.edgeSet →
WilliamsonShmoys.HasPlanarDrawingOn L → L.edgeSet ⊆ K.edgeSet) :
3 * Fintype.card V = K.edgeSet.ncard + 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).