Alev's completeness conjecture for the constructed B_n graph solutions
Statement
Let be the type- case, and consider the equation referred to in the source as Equation. Starting from the simple graphs and applying the construction described immediately before the conjecture, one obtains graphs, where denotes the number of partitions of .
Alev's completeness conjecture. For every integer , these constructed graphs are the only solutions of the equation.
The claim would classify all solutions in the case by the preceding graph construction. No general proof or disproof is supplied 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.