Conjecture on polynomial-time enumeration of regular graphs
Statement
Fix and let be the number of unlabeled -regular graphs with vertices.
Regular-graph enumeration conjecture. The sequence can be computed in polynomial time in .
The source notes polynomial recurrences for labeled -regular graphs for each fixed , but does not establish the corresponding claim for unlabeled graphs. 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.