Absence of Zeros for the Chromatic Polynomial on Bounded Degree Graphs

DOI10.1017/S0963548305006942zbMath1082.05034OpenAlexW2149035462MaRDI QIDQ3373657

Christian Borgs

Publication date: 13 March 2006

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

Full work available at URL: https://doi.org/10.1017/s0963548305006942

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (15)

A note on the shameful conjecture ⋮ Linear Bound in Terms of Maxmaxflow for the Chromatic Roots of Series-Parallel Graphs ⋮ Benjamini-Schramm convergence and the distribution of chromatic roots for sparse graphs ⋮ On zeros of the characteristic polynomial of matroids of bounded tree-width ⋮ Continuous particles in the canonical ensemble as an abstract polymer gas ⋮ Fast algorithms at low temperatures via Markov chains† ⋮ Benjamini-Schramm continuity of root moments of graph polynomials ⋮ Two remarks on the adjoint polynomial ⋮ Unnamed Item ⋮ Regions Without Complex Zeros for Chromatic Polynomials on Graphs with Bounded Degree ⋮ On Brenti's conjecture about the log-concavity of the chromatic polynomial ⋮ Left and right convergence of graphs with bounded degree ⋮ A proof of the upper matching conjecture for large graphs ⋮ A little statistical mechanics for the graph theorist ⋮ Bounds For The Real Zeros of Chromatic Polynomials

This page was built for publication: Absence of Zeros for the Chromatic Polynomial on Bounded Degree Graphs