Simple graphs on a finite vertex type form a finite set
ProvedWilliamsonShmoys.finite_simpleGraph_universe__p2m_afcb74a2_92ae_4444_9657_28f7f6cf41f5_a1For a finite vertex type, there are only finitely many simple graphs on that type.
Preamble
import Mathlib.Combinatorics.SimpleGraph.Basic set_option autoImplicit false
Formal statement
theorem WilliamsonShmoys.finite_simpleGraph_universe__p2m_afcb74a2_92ae_4444_9657_28f7f6cf41f5_a1
{V : Type} [Fintype V] :
(Set.univ : Set (SimpleGraph V)).Finite := 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).