English

On a characterization of the Grassmann graphs

Combinatorics 2018-06-08 v1

Abstract

In 1995, Metsch showed that the Grassmann graph Jq(n,D)J_q(n,D) of diameter D3D\geq 3 is characterized by its intersection numbers with the following possible exceptions: (-) n=2Dn=2D or n=2D+1n=2D+1, q2q\geq 2; (-) n=2D+2n=2D+2 and q{2,3}q\in \{2,3\}; (-) n=2D+3n=2D+3 and q=2q=2. In 2005, Van Dam and Koolen constructed the twisted Grassmann graphs with the same intersection numbers as the Grassmann graphs Jq(2D+1,D)J_q(2D+1,D), for any prime power qq and diameter D2D\geq 2, but they are not isomorphic. We show that the Grassmann graph Jq(2D,D)J_q(2D,D) is characterized by its intersection numbers provided that the diameter DD 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}
}
R2 v1 2026-06-23T02:22:23.670Z