Abstract
In this paper, we establish a new upper bound to the chromatic number of a uniform hypergraph having no cycles of length two or three. The proof is based on a recent lower bound to the chromatic polynomial.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
K. Dohmen, A Contribution to the Chromatic Theory of Uniform Hypergraphs, Result. Math. 28 (1995), 49–52.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Dohmen, K. An Upper Bound to the Chromatic Number of a Uniform Hypergraph without Cycles of Length Two or Three. Results. Math. 36, 55–56 (1999). https://doi.org/10.1007/BF03322101
Received:
Published:
Issue Date:
DOI: https://doi.org/10.1007/BF03322101