Recursion relations for chromatic coefficients for graphs and hypergraphs
Combinatorics
2022-01-04 v2
Abstract
We establish a set of recursion relations for the coefficients in the chromatic polynomial of a graph or a hypergraph. As an application we 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 -complete hypergraph in terms of roots of the Taylor polynomials for the exponential function.
Cite
@article{arxiv.1901.00899,
title = {Recursion relations for chromatic coefficients for graphs and hypergraphs},
author = {Bergfinnur Durhuus and Angelo Lucia},
journal= {arXiv preprint arXiv:1901.00899},
year = {2022}
}
Comments
16 pages. v2: accepted for publication in Discussiones Mathematicae Graph Theory