ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GG be a connected graph, let TT be a well-covered tree, and let I(G,x)I(G,x) denote the independence polynomial of GG. Levit–Mandrescu conjecture. If

I(T,x)=I(G,x),I(T,x)=I(G,x),

then GG is a well-covered tree. The conjecture concerns whether independence-polynomial equivalence with a well-covered tree forces the other graph to share that structure; the paper later gives an infinite family of counterexamples, so the conjecture is refuted.

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.