ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Given a graph GG, its self-chromatic symmetric function is XGGX_G^G. Two graphs are self-distinguishable when their self-chromatic symmetric functions are different. For two non-isomorphic trees T1T_1 and T2T_2,

Self-distinguishability conjecture. XT1T1≠XT2T2X_{T_1}^{T_1} \neq X_{T_2}^{T_2}.

The conjecture asserts that trees are distinguished up to isomorphism by their self-chromatic symmetric functions. The paper reports verification for trees with up to 99 vertices, while the general case 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.