The geometric girth of a distance-regular graph having certain thin irreducible modules for the Terwilliger algebra (Q819010): Difference between revisions

Let \(\Gamma \) be a distance-regular graph which does not contain any subgraph isomorphic to \(K_{2,1,1}\). Then the geometric girth \(\text{gg}(\Gamma )\) of \(\Gamma \) is the length of the shortest reduced circuit in \(\Gamma \). One of the research problems in the field of distance-regular graphs is to prove that there is an absolute constant bound on the geometric girth of a distance-regular graph with valency at least \(3\). To study this problem an algebra \(T\) is constructed by \textit{P. Terwilliger} [J. Algebr. Comb. 1, 363--388 (1992; Zbl 0785.05089)] and using this \textit{B. Collins} [Graphs Comb. 13, 21--30 (1997; Zbl 0878.05084)] proved that if every irreducible \(T\)-module is thin, then \(\text{gg}(\Gamma )\leq 8\) . In the paper under review the author modifies the result of Collins under the assumption that every \(T\)-module of endpoint at most \(3\) is thin.