ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let TT and T′T' 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 GG is denoted by X(G;x)X(G;\mathbf{x}). Stanley–Schwartz–Zaks conjecture. If TT and T′T' are non-isomorphic trees, then

X(T;x)≠X(T′;x).X(T;\mathbf{x})\neq X(T';\mathbf{x}).

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 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.