2009 Discrete Maths Seminar - 03

We look at the problem of recovering a graph from its chromatic symmetric function. For any graph we show that some basic data can be recovered, and for special cases of trees and unicyclic graphs we can recover the graph completely.