Let G be a finite simple graph. In 2006, Richard Stanley proved that “The absolute value of the chromatic polynomial evaluated at -1 equals the number of acyclic orientations of G”.
In this talk, we shall see a
proof of this result using Xavier Viennot’s heaps of pieces.
