Shamil Asgarli
Santa Clara University
Chromatic quasisymmetric functions of the path graph
October 8, 2024 - 4:00 pm to 5:00 pm
Zoom
The chromatic polynomial of a graph G counts the number of proper k-colorings of G. In 1995, Stanley extended this concept to define the chromatic symmetric function of a graph, which lives in the ring Sym of all symmetric functions. Building on this work, Shareshian and Wachs ...
Read more