English

A characterization of the Grassmann graphs: one missing case

Combinatorics 2024-12-17 v1

Abstract

We prove that the Grassmann graphs J2(2D+3,D)J_2(2D+3,D), D3D\geq 3, are characterized by their intersection numbers, which settles one of the few remaining cases.

Keywords

Cite

@article{arxiv.2412.11018,
  title  = {A characterization of the Grassmann graphs: one missing case},
  author = {Jack H. Koolen and Chenhui Lv and Alexander L. Gavrilyuk},
  journal= {arXiv preprint arXiv:2412.11018},
  year   = {2024}
}
R2 v1 2026-06-28T20:35:34.039Z