Bounding the parameter β of a distance-regular graph with classical parameters
Abstract
Let be a distance-regular graph with classical parameters (D, b, α, β) satisfying b≥ 2 and D≥ 3. Let r=1+b+b2+·s+bD-1. In 1999, K. Metsch showed that there exists a positive constant C(α,b) only depending on α and b, such that if β ≥ C(α, b)r2, then either is a Grassmann graph or a bilinear forms graph. In this work, we show that for b≥ 2 and D≥ 3, then there exists a constant C1(α, b) only depending on α and b, such that if β ≥ C1(α, b)r, then either is a Grassmann graph, or a bilinear forms graph.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.