The Stanley–Schwartz–Zaks conjecture on distinguishing trees by their chromatic symmetric functions
Statement
Let and be trees, and call them non-isomorphic when they do not become the same graph after removing vertex labels. The chromatic symmetric function of a graph is denoted by . Stanley–Schwartz–Zaks conjecture. If and are non-isomorphic trees, then
This conjecture asks whether the chromatic symmetric function distinguishes all trees up to isomorphism, even though the ordinary chromatic polynomial does not. It is commonly known as the tree-isomorphism conjecture for chromatic symmetric functions and remains open in general.
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.