Edge count of a maximal drawable graph
ProvedWilliamsonShmoys.maximal_drawable_graph_edge_count__p2m_642d3dbe_c8d0_469e_ba26_5e9db8ed7bc7_a1A drawable simple graph on at least three vertices that has no proper drawable supergraph on those vertices has exactly 3n−6 edges.
Preamble
import Mathlib import Definitions.Def_WilliamsonShmoys_PlanarDrawingOn set_option autoImplicit false
Formal statement
theorem WilliamsonShmoys.maximal_drawable_graph_edge_count__p2m_642d3dbe_c8d0_469e_ba26_5e9db8ed7bc7_a1
{V : Type} [Fintype V] [LinearOrder V]
(P : SimpleGraph V)
(hDraw : WilliamsonShmoys.HasPlanarDrawingOn P)
(hMax : ∀ Q : SimpleGraph V, P ≤ Q → WilliamsonShmoys.HasPlanarDrawingOn Q → Q = P)
(hCard : 3 ≤ Fintype.card V) :
P.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).