2604.01305 Chromatic Symmetric Functions Distinguish Non-Isomorphic Trees Up to 33 Vertices: A Computational Proof
We present new results on chromatic polynomials with applications to graph isomorphism. Our main theorem establishes sharp bounds that improve upon the best previously known results, settling a conjecture in the affirmative for the cases considered.