Recursion relations for chromatic coefficients for graphs and hypergraphs
From MaRDI portal
Publication:2062676
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.
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.
Recommendations
- Some properties of chromatic coefficients of linear uniform hypergraphs
- On chromatic polynomials of hypergraphs
- A note on a broken-cycle theorem for hypergraphs
- Reciprocal theorems concerning the chromatic polynomial
- Recursive formulae for the chromatic polynomials of complete r-uniform mixed interval hypergraphs.
Cites work
- A broken-circuits-theorem for hypergraphs
- A Characterization of the Exponential Series
- A note on a broken-cycle theorem for hypergraphs
- An abstraction of Whitney's broken circuit theorem
- An improvement of the inclusion-exclusion principle
- An inductive proof of Whitney's Broken Circuit Theorem
- An introduction to chromatic polynomials
- Bijective proofs of two broken circuit theorems
- Correction: The zeros of the partial sums of the exponential function
- scientific article; zbMATH DE number 43754 (Why is no real title available?)
- scientific article; zbMATH DE number 2148179 (Why is no real title available?)
- scientific article; zbMATH DE number 2199828 (Why is no real title available?)
- HYPERGRAPHS
- Milnor numbers of projective hypersurfaces and the chromatic polynomial of graphs
- On the Zeroes of the Nth Partial Sum of the Exponential Series
- On the Zeros of the Taylor Polynomials Associated with the Exponential Function
- Statistical mechanics of lattice systems. A concrete mathematical introduction
- The dynamical motion of the zeros of the partial sums of \(e^{z}\), and its relationship to discrepancy theory
- The repulsive lattice gas, the independent-set polynomial, and the Lovász local lemma
- The Szego curve, zero distribution and weighted approximation
- The zeros of the partial sums of the exponential function
- The Zeros of the Partial Sums of the Exponential Series
- Topics in Chromatic Graph Theory
Cited in
(9)- A note on a broken-cycle theorem for hypergraphs
- Reciprocal theorems concerning the chromatic polynomial
- Recursive formulae for the chromatic polynomials of complete r-uniform mixed interval hypergraphs.
- A survey on recurrence relations for the independence polynomial of hypergraphs
- A broken cycle theorem for the restrained chromatic function
- Combinatorial Relations and Chromatic Graphs
- Chromatic numbers of Cayley graphs on Z and recurrence
- DP color functions of hypergraphs
- Recurrence relations for graph polynomials on bi-iterative families of graphs
This page was built for publication: Recursion relations for chromatic coefficients for graphs and hypergraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2062676)
