32 Combinatorics Intro: The degree-diameter problem, Moore bound, Hoffman-Singleton theorem

Lecture 32 Introduction Combinatorics: The degree-diameter problem, Moore bound, Hoffman-Singleton theorem, if a d-regular graph has diameter 2 and d^2+1 vertices, then d is 2,3,7 or 57