• 1 Department of mathematics [North Carolina]
• 2 Department of Mathematics

The Stanley chromatic polynomial of a graph $G$ is a symmetric function generalization of the chromatic polynomial, and has interesting combinatorial properties. We apply the ideas of Khovanov homology to construct a homology $H$_*($G$) of graded $S_n$-modules, whose graded Frobenius series $Frob_G(q,t)$ reduces to the chromatic symmetric function at $q=t=1$. We also obtain analogues of several familiar properties of the chromatic symmetric polynomials in terms of homology.