Bounds on the chromatic polynomial and on the number of acyclic orientations of a graph

Nabil Kahale, Leonard J. Schulman
1996 Combinatorica  
An upper bound is given on the number of acyclic orientations of a graph, in terms of the spectrum of its Laplacian. It is shown that this improves upon the previously known bound, which depended on the degree sequence of the graph. Estimates on the new bound are provided. A lower bound on the number of acyclic orientations of a graph is given, with the help of the probabilistic method. This argument can take advantage of structural properties of the graph: it is shown how to obtain stronger
more » ... nds for small-degree graphs of girth at least ve, than are possible for arbitrary graphs. A simpler proof of the known lower bound for arbitrary graphs is also obtained. Both the upper and lower bounds are shown to extend to the general problem of bounding the chromatic polynomial from above and below along the negative real axis.
doi:10.1007/bf01261322 fatcat:yqt5aggkuzg6ldfdrysvd63kxu