Sokal's half-plane conjecture for chromatic roots

From papers

Let GG be a graph, let Δ(G)\Delta(G) denote its maximum degree, and let P(G,t)P(G,t) be its chromatic polynomial. Sokal's conjecture.

P(G,t)>0|P(G,t)|>0

for every complex number tt satisfying

Re(t)>Δ(G).\operatorname{Re}(t)>\Delta(G).

This would strengthen the known zero-free exterior disc bound tCΔ(G)|t|\geq C\Delta(G) and would be a half-plane analogue of Brooks's theorem. The source presents it as a possible extension and gives no resolution.

Progress summary

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Sources & referencesView supporting material

Primary source

Bill Jackson, “Zeros of Chromatic and Flow Polynomials of Graphs”, arXiv:math/0205047 (2002).

Solutions 0

No solutions have been posted yet.