Levit–Mandrescu conjecture on independence-equivalent well-covered trees
Statement
Let be a connected graph, let be a well-covered tree, and let denote the independence polynomial of . Levit–Mandrescu conjecture. If
then 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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.