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

DOI10.1017/S0963548307008632zbMath1171.05017arXiv0704.2617MaRDI QIDQ3512601

Aldo Procacci, Roberto Fernández

Publication date: 21 July 2008

Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/0704.2617

zbMATH Keywords

chromatic polynomialtriangle free verticeszero free

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (14)

On zero-free regions for the anti-ferromagnetic Potts model on bounded-degree graphs ⋮ A note on the shameful conjecture ⋮ Linear Bound in Terms of Maxmaxflow for the Chromatic Roots of Series-Parallel Graphs ⋮ Virial series for a system of classical particles interacting through a pair potential with negative minimum ⋮ Continuous particles in the canonical ensemble as an abstract polymer gas ⋮ Improved bounds on coloring of graphs ⋮ Approximating the chromatic polynomial is as hard as computing it exactly ⋮ On Brenti's conjecture about the log-concavity of the chromatic polynomial ⋮ Transfer matrices and partition-function zeros for antiferromagnetic Potts models. VI. Square lattice with extra-vertex boundary conditions ⋮ On Lennard-Jones type potentials and hard-core potentials with an attractive tail ⋮ Sidorenko's conjecture, colorings and independent sets ⋮ A little statistical mechanics for the graph theorist ⋮ On the convergence of cluster expansions for polymer gases ⋮ New bounds for chromatic polynomials and chromatic roots

Cites Work

• Cluster expansion for abstract polymer models
• Polymer gas approach to \(N\)-body lattice systems
• Potts model on infinite graphs and the limit of chromatic polynomials
• Absence of Zeros for the Chromatic Polynomial on Bounded Degree Graphs

This page was built for publication: Regions Without Complex Zeros for Chromatic Polynomials on Graphs with Bounded Degree