Aval's oriented tree isomorphism conjecture
Aval's oriented tree isomorphism conjecture
Let and be trees equipped with orientations . For an orientation , let denote the oriented chromatic quasisymmetric function obtained by weighting proper colorings according to the number of oriented ascents. Aval's oriented tree isomorphism conjecture. If and are non-isomorphic oriented trees, then
This generalizes the tree isomorphism conjecture to oriented chromatic quasisymmetric functions. The supplied text gives no resolution status for this oriented version, so it remains open in this record.
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Sources & referencesView supporting material
Primary source
Laura Colmenarejo and Ian Klein, “The Total Chromatic Quasisymmetric Functions of a Graph”, arXiv:2601.23170 (2026).
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.