Abstract: | Let be a simple graph with nodes. The coloring complex of , as defined by Steingrimsson, has -faces consisting of all ordered set partitions, in which at least one contains an edge of . Jonsson proved that the homology of the coloring complex is concentrated in the top degree. In addition, Jonsson showed that the dimension of the top homology is one less than the number of acyclic orientations of . In this paper, we show that the Eulerian idempotents give a decomposition of the top homology of into components . We go on to prove that the dimensions of the Hodge pieces of the homology are equal to the absolute values of the coefficients of the chromatic polynomial of . Specifically, if we write , then . |