The independence-polynomial characterization of well-covered trees
Statement
Let be a well-covered tree and let be a graph. Suppose their independence polynomials agree:
A graph is well-covered if all its maximal stable sets have the same cardinality.
Independence-polynomial characterization conjecture. If is a well-covered tree and , then is well-covered.
The paper motivates this conjecture by examples of claw-free graphs that are both well-covered and have the same independence polynomials as the well-covered trees under investigation. The source provides no resolution status.
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.