ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let n≥4n\geq 4 be odd, let CnC_n be the cyclic graph on nn vertices, and let DnD_n be the graph shown in Figure~. Two graphs are independence equivalent when they have the same independence polynomial.

Beaton–Brown–Cameron conjecture. If 3∤n3\not\vert n, then a graph GG is independence equivalent to CnC_n if and only if

G∈{Cn,Dn}.G\in\{C_n,D_n\}.

This conjecture asks for a complete description of the independence equivalence class of CnC_n for odd n≥4n\geq 4 not divisible by 33. The cited results establish the analogous classification for even n≥4n\geq 4, except n=6n=6, and for prime powers n=pkn=p^k with p≥5p\geq 5 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 in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.