A constant bound on the number of columns \((1,k-2,1)\) in the intersection array of a distance-regular graph (Q1911238): Difference between revisions

For any distance-regular graph with valency \(k \geq 3\) the author shows that the number of columns \((1, k-2, 1)\) in its intersection array is at most 20 by using the intersection diagrams of the graph.