Chromatic polynomials and the symmetric group (Q1889850): Difference between revisions

The author gives a new combinatorial interpretation of the coefficients of chromatic polynomials of graphs in terms of subsets of permutations and introduces a combinatorially defined polynomial associated to a directed graph. He proves that it is related to the chromatic polynomials. These polynomials are a specialization of the cover polynomials of digraphs. Some open questions are posed too.