ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GG be a graph, and let fbarXGfbar{X}_G denote its Kromatic symmetric function. Two graphs are isomorphic when they differ only by a relabeling of their vertices. Pierson's conjecture. There do not exist nonisomorphic graphs GG and HH with X‾G=X‾H\overline{X}_G=\overline{X}_H. Equivalently, the Kromatic symmetric function distinguishes all graphs up to isomorphism. The Kromatic symmetric function contains more information than the chromatic symmetric function, and is known to determine the number of induced copies of several graphs; whether it distinguishes every graph remains open.

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.