Exact unconnected-graph count conjecture for linear equational graphs
Statement
Let be a prime, let be defined by
and let denote the number of unconnected graphs in the linear family. Exact-count conjecture. For any prime , . The computations reported in the source support this equality for the tested primes up to , but no proof or resolution is given.
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.