ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let gg and dd be positive integers. A graph is dd-regular if every vertex has degree dd, its girth is the length of its shortest cycle, and its order is its number of vertices. Folklore conjecture. For every positive integers gg and dd, there exists a dd-regular graph GG of girth at least gg and order

Θ((d−1)(12+o(1))g).\Theta\left((d-1)^{(\frac{1}{2}+o(1))g}\right).

The source describes this as a folklore conjecture related to the Moore bound and as the analogue of the preceding cubic-graph assertion for every fixed degree. The supplied status is unknown, so it remains open in this record.

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.