A bound on the clique parameters of geometric distance-regular graphs
Statement
Let be a geometric distance-regular graph with diameter and distinct eigenvalues
Let . For a Delsarte clique, let denote the number of clique vertices at distance from a vertex at distance from the clique. The -bound conjecture. There exists a function such that, if , then . This conjecture seeks uniform bounds on the clique parameters of geometric distance-regular graphs; the preceding proposition establishes such a bound for under an additional lower bound on , while the 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.