There are only finitely many distance-regular graphs of fixed valency greater than two

2009/09/29 by Bang, S., Dubickas, A., Koolen, J. H. +1
#05E15 #05E30 #Combinatorics (math.CO) #FOS: Mathematics

paper · doi:10.48550/arxiv.0909.5253

Abstract

In this paper we prove the Bannai-Ito conjecture, namely that there are only finitely many distance-regular graphs of fixed valency greater than two.

Related

• There are only finitely many distance-regular graphs with valency k at\n least three, fixed ratio k2/k and large diameter
• Distance-regular graph with large a1 or c2
• Distance-regular graphs with valency k having smallest eigenvalue at most -k/2
• Non-bipartite distance-regular graphs with a small smallest eigenvalue
• Shilla distance-regular graphs