ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let TT be a well-covered tree and let GG be a graph. Suppose their independence polynomials agree:

I(T;x)=I(G;x).I(T;x)=I(G;x).

A graph is well-covered if all its maximal stable sets have the same cardinality.

Independence-polynomial characterization conjecture. If TT is a well-covered tree and I(T;x)=I(G;x)I(T;x)=I(G;x), then GG 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 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.