Tree isomorphism conjecture for chromatic symmetric functions
Tree isomorphism conjecture for chromatic symmetric functions
Let and be trees, and let denote the chromatic symmetric function of . Tree isomorphism conjecture. If and are non-isomorphic trees, then
The conjecture asks whether the chromatic symmetric function distinguishes trees. It has been computationally verified for all trees with at most 29 vertices and for certain classes of trees, but the general statement remains open.
Sources & referencesView supporting material
Primary source
Laura Colmenarejo and Ian Klein, “The Total Chromatic Quasisymmetric Functions of a Graph”, arXiv:2601.23170 (2026).
Additional references
2 papers in this index state this conjecture (2019–2026). The statement above is taken from the most recent of them; the others are arXiv:1910.11859.
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.