Absence of Zeros for the Chromatic Polynomial on Bounded Degree Graphs

DOI10.1017/S0963548305006942zbMATH Open1082.05034OpenAlexW2149035462MaRDI QIDQ3373657FDOQ3373657

Authors 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)

Recommendations

• Regions Without Complex Zeros for Chromatic Polynomials on Graphs with Bounded Degree
• Bounds For The Real Zeros of Chromatic Polynomials
• Bounds on the complex zeros of (di)chromatic polynomials and Potts-model partition functions
• Two Results on Real Zeros of Chromatic Polynomials
• On the location of chromatic zeros of series-parallel graphs

Cited in

(22)

• Linear Bound in Terms of Maxmaxflow for the Chromatic Roots of Series-Parallel Graphs
• On Brenti's conjecture about the log-concavity of the chromatic polynomial
• Left and right convergence of graphs with bounded degree
• The largest non-integer real zero of chromatic polynomials of graphs with fixed order
• Fast algorithms at low temperatures via Markov chains†
• A little statistical mechanics for the graph theorist
• A note on the shameful conjecture
• On Zero-Free Intervals in $(1,2)$ of Chromatic Polynomials of Some Families of Graphs
• Bounds on the complex zeros of (di)chromatic polynomials and Potts-model partition functions
• scientific article; zbMATH DE number 7650108 (Why is no real title available?)
• Two remarks on the adjoint polynomial
• Improved bounds for the zeros of the chromatic polynomial via Whitney's broken circuit theorem
• Regions Without Complex Zeros for Chromatic Polynomials on Graphs with Bounded Degree
• Continuous particles in the canonical ensemble as an abstract polymer gas
• On the location of chromatic zeros of series-parallel graphs
• A proof of the upper matching conjecture for large graphs
• Bounds For The Real Zeros of Chromatic Polynomials
• Benjamini-Schramm convergence and the distribution of chromatic roots for sparse graphs
• Cayley trees do not determine the maximal zero-free locus of the independence polynomial
• On zeros of the characteristic polynomial of matroids of bounded tree-width
• Benjamini-Schramm continuity of root moments of graph polynomials
• A Zero-Free Interval for Chromatic Polynomials of Graphs

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3373657)