Published November 18, 2019
| Accepted Version + Published
Journal Article
Open
Recursion relations for chromatic coefficients for graphs and hypergraphs
- Creators
-
Durhuus, Bergfinnur
-
Lucia, Angelo
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.
Additional Information
© 2022 University of Zielona Góra. Received: 2019-03-25, Revised: 2019-07-06, Accepted: 2019-07-31, Available online: 2019-11-18. The authors acknowledge support from the Villum Foundation via the QMATH Centre of Excellence (Grant no. 19959). A.L. acknowledges support from the Walter Burke Institute for Theoretical Physics in the form of the Sherman Fairchild Fellowship as well as support from the Institute for Quantum Information and Matter (IQIM), an NSF Physics Frontiers Center (NFS Grant PHY-1733907).Attached Files
Published - DMGT-2248.pdf
Accepted Version - 1901.00899.pdf
Files
1901.00899.pdf
Files
(433.9 kB)
| Name | Size | Download all |
|---|---|---|
|
md5:28e70fa3f6113da5e060e97f47f0dff7
|
221.9 kB | Preview Download |
|
md5:3c9c76899373824473bec7914ad2e0a9
|
211.9 kB | Preview Download |
Additional details
- Eprint ID
- 113132
- Resolver ID
- CaltechAUTHORS:20220127-789177900
- Villum Foundation
- 19959
- Walter Burke Institute for Theoretical Physics, Caltech
- Sherman Fairchild Foundation
- Institute for Quantum Information and Matter (IQIM)
- NSF
- PHY-1733907
- Created
-
2022-01-28Created from EPrint's datestamp field
- Updated
-
2022-01-28Created from EPrint's last_modified field
- Caltech groups
- Institute for Quantum Information and Matter, Walter Burke Institute for Theoretical Physics