Density conjecture for chromatic roots of the graphs
Let be the graph family considered in the paper, and let a chromatic root mean a zero of its chromatic polynomial in the complex -plane. There exists a finite constant such that
is filled densely by chromatic roots of as . Chromatic-root density conjecture. There exists a constant such that the chromatic roots of the graphs become dense in the region when . The conjecture concerns uniformity in ; the paper emphasizes that the available fixed- asymptotic results do not imply it because their error bounds need not be uniform. Thus the claim remains open.
References
- Jesús Salas and Alan D. Sokal, “Transfer matrices and partition-function zeros for antiferromagnetic Potts models. VI. Square lattice with special boundary conditions”, arXiv:1002.3761 (2011).
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.