The complete graph edge bound forces at most four vertices
ProvedWilliamsonShmoys.choose_two_planar_bound__p2m_5e2c5d47_5385_4c28_8f25_877ce4670fc9_a1approximation-algorithmsplanar-graphstreewidth
For a natural number n of at least three, if the complete graph edge count n.choose 2 satisfies the planar edge bound, then n is at most four. The independent proof route rewrites the binomial coefficient using Nat.choose_two_right and rules out n at least five.
Preamble
import Mathlib set_option autoImplicit false
Formal statement
theorem WilliamsonShmoys.choose_two_planar_bound__p2m_5e2c5d47_5385_4c28_8f25_877ce4670fc9_a1 (n : ℕ)
(hcard : 3 ≤ n)
(hedges : n.choose 2 ≤ 3 * n - 6) :
n ≤ 4 := 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).