ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Fix kgreaterthanorequalto1k greater than or equal to 1 and let ana_n be the number of unlabeled kk-regular graphs with nn vertices.

Regular-graph enumeration conjecture. The sequence ana_n can be computed in polynomial time in nn.

The source notes polynomial recurrences for labeled kk-regular graphs for each fixed kk, 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 in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.