Beraha's conjecture on chromatic roots near the Beraha numbers
Beraha's conjecture on chromatic roots near the Beraha numbers
For each integer , define the Beraha number
A plane triangulation is a loopless plane graph whose faces all have size three. Beraha's conjecture. For every and every , there exists a plane triangulation with a real chromatic root in
This would imply the existence of plane triangulations with real chromatic roots arbitrarily close to , since tends to . The source says that this remains open, while complex roots arbitrarily close to are known.
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
Sign in to submit a solution.
No solutions have been posted yet.