Salas–Sokal conjecture for planar bipartite graphs
Salas–Sokal conjecture for planar bipartite graphs
From papers
Let be a planar bipartite graph, and let be its chromatic polynomial. Let be the golden ratio. Salas–Sokal conjecture.
Equivalently, planar bipartite graphs should have no real chromatic roots at or above . The source notes that Salas and Sokal constructed families with chromatic roots tending to , giving evidence for sharpness.
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.