Self-distinguishability conjecture for trees
Statement
Given a graph , its self-chromatic symmetric function is . Two graphs are self-distinguishable when their self-chromatic symmetric functions are different. For two non-isomorphic trees and ,
Self-distinguishability conjecture. .
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 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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.