Finiteness of simple graphs on a finite vertex type
Provedfinite_simpleGraph_of_fintype__p2m_02bccae1_cc3c_48e5_a34b_9f4a9988edab_a1If the vertex type is finite, then the type of simple graphs on it is finite.
Preamble
import Mathlib
Formal statement
theorem finite_simpleGraph_of_fintype__p2m_02bccae1_cc3c_48e5_a34b_9f4a9988edab_a1 (V : Type) [Fintype V] : Finite (SimpleGraph V) := by sorry
Source
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).