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 r-complete hypergraph in terms of roots of the Taylor polynomials for the exponential function.
Recursion Relations for Chromatic Coefficients for Graphs and Hypergraphs
Lucia, A.
2022-01-01
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 r-complete hypergraph in terms of roots of the Taylor polynomials for the exponential function.File in questo prodotto:
| File | Dimensione | Formato | |
|---|---|---|---|
|
DMGT-2248.pdf
accesso aperto
:
Publisher’s version
Dimensione
380.57 kB
Formato
Adobe PDF
|
380.57 kB | Adobe PDF | Visualizza/Apri |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
