Connectedness conjecture for cubic equational graphs over finite fields
Statement
Let be an odd prime satisfying , let be the field with elements, and let denote the associated cubic equational graph over , with ranging over and . Cubic connectedness conjecture. Almost all the graphs over are connected as tends to infinity through primes satisfying . This is supported by computations in the cubic case, but remains unresolved in the source.
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.