On a characterization of the Grassmann graphs
Combinatorics
2018-06-08 v1
Abstract
In 1995, Metsch showed that the Grassmann graph of diameter is characterized by its intersection numbers with the following possible exceptions: (-) or , ; (-) and ; (-) and . In 2005, Van Dam and Koolen constructed the twisted Grassmann graphs with the same intersection numbers as the Grassmann graphs , for any prime power and diameter , but they are not isomorphic. We show that the Grassmann graph is characterized by its intersection numbers provided that the diameter is large enough.
Keywords
Cite
@article{arxiv.1806.02652,
title = {On a characterization of the Grassmann graphs},
author = {Alexander L. Gavrilyuk and Jack H. Koolen},
journal= {arXiv preprint arXiv:1806.02652},
year = {2018}
}