Recursion relations for chromatic coefficients for graphs and hypergraphs (Q2062676): Difference between revisions

The authors establish a set of recursion relations for the coefficients in the chromatic polynomial of a graph or a hypergraph. As an application they provide a generalization of Whitney's broken cycle theorem for hypergraphs, as well as deriving an explicit formula for the linear coefficient of the chromatic polynomial of the \(r\)-complete hypergraph in terms of roots of the Taylor polynomials for the exponential function.