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

S. Bang; A. Dubickas; J. H. Koolen; V. Moulton

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

Combinatorics 2009-09-30 v1

Authors: S. Bang , A. Dubickas , J. H. Koolen , V. Moulton

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.

Keywords

distance-regular graph Bannai-Ito conjecture finite graph valency graph theory

Cite

@article{arxiv.0909.5253,
  title  = {There are only finitely many distance-regular graphs of fixed valency greater than two},
  author = {S. Bang and A. Dubickas and J. H. Koolen and V. Moulton},
  journal= {arXiv preprint arXiv:0909.5253},
  year   = {2009}
}