Chromatic Coefficients of Linear Uniform Hypergraphs

In this paper, formulae are given for the coefficients of the highest powers ofλin the chromatic polynomialP(H, λ) of a linear uniform hypergraphH, thus generalizing the corresponding result of Meredith for graphs. The new result implies, among other things, that the elementaryh-uniform cycleChmwithmedges is chromatically unique for allm,h⩾3.