Exact unconnected-graph count conjecture for cubic equational graphs
Statement
Let be a prime satisfying , let be the piecewise function defined by
and let denote the number of unconnected graphs with and . Cubic exact-count conjecture. For any prime satisfying , . The source reports computational verification for the relevant primes up to , but provides no proof or resolution.
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.