Jackson–Sokal maxmaxflow bound conjecture for chromatic roots
Statement
For a loopless graph , let be the maximum number of edge-disjoint paths between distinct vertices and , and let the maxmaxflow be
A chromatic root is a zero of the chromatic polynomial. Jackson–Sokal's conjecture. For every value , there exists a universal constant such that all chromatic roots, real or complex, of all loopless graphs of maxmaxflow lie in
Moreover, is conjectured to be linear in . This would extend bounds in terms of the second-largest vertex degree to a matroidally meaningful graph parameter; the supplied text gives no resolution.
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.