The NA+ conjecture for random cluster measures with q<1

Let GG be a finite graph and consider a random cluster measure on its edge sets with parameter q<1q<1. Random-cluster conjecture. Every such random cluster measure is NA+. Equivalently, the measures are NA. The conjecture would encompass uniform measures on forests, spanning trees, and connected subgraphs; a related NC+ statement was noted to be proved for series-parallel graphs.

Sources & referencesView supporting material

Primary source

Jeff Kahn and Michael Neiman, “Negative correlation and log-concavity”, arXiv:0712.3507 (2009).

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.