Folklore conjecture on the order of regular graphs with prescribed girth
Statement
Let and be positive integers. A graph is -regular if every vertex has degree , its girth is the length of its shortest cycle, and its order is its number of vertices. Folklore conjecture. For every positive integers and , there exists a -regular graph of girth at least and order
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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.