Beaton–Brown–Cameron conjecture on independence equivalence of odd cycles
Statement
Let be odd, let be the cyclic graph on vertices, and let be the graph shown in Figure~. Two graphs are independence equivalent when they have the same independence polynomial.
Beaton–Brown–Cameron conjecture. If , then a graph is independence equivalent to if and only if
This conjecture asks for a complete description of the independence equivalence class of for odd not divisible by . The cited results establish the analogous classification for even , except , and for prime powers with prime; the stated odd-cycle case remains open here.
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.