Bounding the parameter $\beta$ of a distance-regular graph with classical parameters
Combinatorics
2025-12-22 v2
Abstract
Let be a distance-regular graph with classical parameters satisfying and . Let . In 1999, K. Metsch showed that there exists a positive constant only depending on and , such that if , then either is a Grassmann graph or a bilinear forms graph. In this work, we show that for and , then there exists a constant only depending on and , such that if , then either 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}
}