English

Bounding the parameter $\beta$ of a distance-regular graph with classical parameters

Combinatorics 2025-12-22 v2

Abstract

Let Γ\Gamma be a distance-regular graph with classical parameters (D,b,α,β)(D, b, \alpha, \beta) satisfying b2b\geq 2 and D3D\geq 3. Let r=1+b+b2++bD1r=1+b+b^2+\cdots+b^{D-1}. In 1999, K. Metsch showed that there exists a positive constant C(α,b)C(\alpha,b) only depending on α\alpha and bb, such that if βC(α,b)r2\beta \geq C(\alpha, b)r^2, then either Γ\Gamma is a Grassmann graph or a bilinear forms graph. In this work, we show that for b2b\geq 2 and D3D\geq 3, then there exists a constant C1(α,b)C_1(\alpha, b) only depending on α\alpha and bb, such that if βC1(α,b)r\beta \geq C_1(\alpha, b)r, then either Γ\Gamma is a Grassmann graph, or a bilinear forms graph.

Keywords

Cite

@article{arxiv.2410.22994,
  title  = {Bounding the parameter $\beta$ of a distance-regular graph with classical parameters},
  author = {Chenhui Lv and Jack H. Koolen},
  journal= {arXiv preprint arXiv:2410.22994},
  year   = {2025}
}
R2 v1 2026-06-28T19:41:09.916Z