Sokal's half-plane conjecture for chromatic roots
Let be a graph, let denote its maximum degree, and let be its chromatic polynomial. Sokal's conjecture.
for every complex number satisfying
This would strengthen the known zero-free exterior disc bound and would be a half-plane analogue of Brooks's theorem. The source presents it as a possible extension and gives no resolution.
References
Primary source
Bill Jackson, “Zeros of Chromatic and Flow Polynomials of Graphs”, arXiv:math/0205047 (2002).
Progress summary
Never refreshed
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
No solutions have been posted yet.