Conjecture on sublinear chromatic-root bounds for series-parallel graphs
Statement
Let be a finite undirected graph, let denote its maximum degree, and let be its chromatic polynomial.
Series-parallel chromatic-root bound. There exists a universal constant such that, for every series-parallel graph of maximum degree , every chromatic root lies in
The paper proves a bound of this order for generalized theta graphs and conjectures that the methods extend to arbitrary series-parallel graphs; it also remarks that an analogous statement for all planar graphs is only conceivable, not asserted.
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.