Positivity of the chromatic polynomial above maxmaxflow

From papers

Let GG be a loopless graph with maxmaxflow Λ\Lambda, and let PG(q)P_G(q) be its chromatic polynomial. Maxmaxflow chromatic positivity conjecture. For every real q>Λq>\Lambda,

PG(q)>0.P_G(q)>0.

In particular, PG(q)P_G(q) has no roots in (Λ,)(\Lambda,\infty). The source presents this as a consequence of the derivative-positivity conjecture; the supplied status evidence reports counterexamples to the stronger preceding conjectures, so this claim is marked refuted.

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

Alan D. Sokal, “The multivariate Tutte polynomial (alias Potts model) for graphs and matroids”, arXiv:math/0503607 (2005).

Solutions 0

No solutions have been posted yet.