Density conjecture for chromatic roots of the graphs S_m,n
Statement
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.
Record
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.