Moore graph extremality conjecture for the connected-set growth constant
Statement
Let denote the exponential growth constant for the maximum number of connected vertex subsets among -regular graphs of order . A Moore graph is a -regular graph of a given girth that attains the theoretical lower bound, the Moore bound, on its order. If is a -regular Moore graph of order , then Moore graph extremality conjecture. For every ,
The conjecture asserts that Moore graphs are extremal and that increasing the order beyond a Moore graph strictly lowers the corresponding growth constant. The paper notes that exact extremal graphs are difficult to describe in general and that is not monotone decreasing, so the claim is a specific strict comparison after an order attained by a Moore graph; no resolution is supplied.
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.