A diameter-bound conjecture for distance-regular graphs with classical parameters
Statement
Let be a distance-regular graph with classical parameters .
Diameter-bound conjecture. There is a constant such that if , then one of the following statements holds:
- If is a perfect square, then .
- If is not a perfect square, then .
This conjecture proposes a uniform bound on the parameter for sufficiently large diameter, with the exceptional value allowed only when is a perfect square. The paper establishes related bounds for restricted ranges of and large , but the stated general assertion remains open.
Record
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.