Recursion Relations for Chromatic Coefficients for Graphs and Hypergraphs

@article{Durhuus2022RecursionRF,
  title={Recursion Relations for Chromatic Coefficients for Graphs and Hypergraphs},
  author={Bergfinnur Durhuus and Angelo Lucia},
  journal={Discussiones Mathematicae Graph Theory},
  year={2022},
  volume={42},
  pages={101 - 121}
}
  • B. Durhuus, A. Lucia
  • Published 3 January 2019
  • Mathematics
  • Discussiones Mathematicae Graph Theory
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. 

References

SHOWING 1-10 OF 30 REFERENCES

A Note on a Broken-Cycle Theorem for Hypergraphs

TLDR
A definition of cycles in hypergraphs that preserves the statement of the Broken-cycle Theorem and states the chromatic polynomial of a graph as a sum over special edge subsets.

An Introduction to Chromatic Polynomials

This paper will provide an introduction to chromatic polynomials. We will first define chromatic polynomials and related terms, and then derive important properties. Once the basics have been

Milnor numbers of projective hypersurfaces and the chromatic polynomial of graphs

The chromatic polynomial of a graph G counts the number of proper colorings of G. We give an affirmative answer to the conjecture of Read and Rota-Heron-Welsh that the absolute values of the

Chromatic polynomials and chro-maticity of graphs

# The Number of -Colourings and Its Enumerations # Chromatic Polynomials # Chromatic Equivalence of Graphs # Chromaticity of Multi-Partite Graphs # Chromaticity of Subdivisions of Graphs # Graphs in

An Abstraction of Whitney's Broken Circuit Theorem

TLDR
An even broader generalization of Whitney's broken circuit theorem is established in the context of convex geometries (antimatroids) and is derived of the maximums-minimums identity and of a theorem due to Blass and Sagan on the M\"obius function of a finite lattice which generalizes Rota's crosscut theorem.

Hypergraphs - combinatorics of finite sets

  • C. Berge
  • Mathematics
    North-Holland mathematical library
  • 1989

An improvement of the inclusion-exclusion principle

Abstract. We present an improvement of the inclusion-exclusion principle in which the number of terms is reduced by predicted cancellation. The improvement generalizes a related result of Narushima

The Repulsive Lattice Gas, the Independent-Set Polynomial, and the Lovász Local Lemma

We elucidate the close connection between the repulsive lattice gas in equilibrium statistical mechanics and the Lovász local lemma in probabilistic combinatorics. We show that the conclusion of the

An inductive proof of Whitney's Broken Circuit Theorem

We present a new proof of Whitney's broken circuit theorem based on induction on the number of edges and the deletion-contraction formula.

On the zeros of the Taylor polynomials associated with the exponential function

Etude de la geometrie des zeros des polynomes de Taylor associes a la fonction exponentielle