Hostname: page-component-77c78cf97d-57qhb Total loading time: 0 Render date: 2026-04-26T09:26:14.506Z Has data issue: false hasContentIssue false

Regions Without Complex Zeros for Chromatic Polynomials on Graphs with Bounded Degree

Published online by Cambridge University Press:  01 March 2008

ROBERTO FERNÁNDEZ
Affiliation:
Laboratoire de Mathématiques Raphaël Salem, UMR 6085 CNRS-Université de Rouen, Avenue de l'Université, BP.12, 76801 Saint Etienne du Rouvray, France (e-mail: Roberto.Fernandez@univ-rouen.fr)
ALDO PROCACCI
Affiliation:
Laboratoire de Mathématiques Raphaël Salem, UMR 6085 CNRS-Université de Rouen, Avenue de l'Université, BP.12, 76801 Saint Etienne du Rouvray, France (e-mail: Roberto.Fernandez@univ-rouen.fr) Departamento de Matemática-ICEx, UFMG, CP 702, Belo Horizonte MG 30.161-970, Brazil (e-mail: aldo@mat.ufmg.br)

Abstract

We prove that the chromatic polynomial of a finite graph of maximal degree Δ is free of zeros for |q| ≥ C*(Δ) withThis improves results by Sokal and Borgs. Furthermore, we present a strengthening of this condition for graphs with no triangle-free vertices.

Information

Type
Paper
Copyright
Copyright © Cambridge University Press 2007

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable