Thomassen's conjecture on real chromatic roots of planar graphs
Thomassen's conjecture on real chromatic roots of planar graphs
From papers
Let be a loopless planar graph, and let be its chromatic polynomial. Thomassen's conjecture. The real chromatic roots of planar graphs are dense everywhere in
Real chromatic roots are already known to be dense in . Extending density to would show that planar graphs have real chromatic roots arbitrarily close to the four-colour threshold.
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.