Parity conjecture for random Cayley graphs of rm PGL_2(p)
Statement
Let , with varying over primes, and consider random -regular Cayley graphs over . Parity conjecture. The girth of such graphs is almost surely even.
This conjecture is based on the paper's computer experiments for random -regular Cayley graphs of ; no proof or 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.