← All problems

Pairwise negative-correlation conjecture for the random-cluster model

For every finite graph G=(V,E)G=(V,E), every edge-parameter vector (pe)e∈E∈[0,1]E(p_e)_{e\in E}\in[0,1]^E, every q∈[0,1]q\in[0,1], and every pair of distinct edges e,f∈Ee,f\in E, the random-cluster measure ϕG,p,q\phi_{G,\mathbf p,q} satisfies ϕG,p,q(e is open,f is open)≤ϕG,p,q(e is open) ϕG,p,q(f is open)\phi_{G,\mathbf p,q}(e\text{ is open},f\text{ is open})\leq \phi_{G,\mathbf p,q}(e\text{ is open})\,\phi_{G,\mathbf p,q}(f\text{ is open}). For q>0q>0, this measure assigns to each configuration ω∈{0,1}E\omega\in\{0,1\}^E probability proportional to qk(ω)∏e∈Epeω(e)(1−pe)1−ω(e)q^{k(\omega)}\prod_{e\in E}p_e^{\omega(e)}(1-p_e)^{1-\omega(e)}, where k(ω)k(\omega) is the number of connected components of the open subgraph; the case q=0q=0 is understood as the limiting measure, equivalently Bernoulli bond percolation conditioned on being connected when such configurations exist.

References

Progress summary

Refreshed
Open · progress reported

The conjecture has been proved for important high-degree graph families, but it remains unsettled for arbitrary finite graphs.

The Kahn–Grimmett–Winkler conjecture asserts pairwise negative correlation in the random-cluster model for 0≤q≤10\leq q\leq 1. It remains a general finite-graph problem.

Known results

  • At q=1q=1, an explicit correlation formula holds for arbitrary graphs and edge weights (2025).
  • Conditional negative association was proved for branch-connectivity indicators on finite wired trees (2026).
  • Related covariance inequalities were proved under the unique infinite-volume wired measure on infinite regular trees (2026).

September 2026 high-degree regular graphs

Pengfei Tang and Zibo Zhang claim the conjecture for expander-like, high-degree regular graph sequences and establish an asymptotic reduction equating this regime with the unrestricted finite-graph problem. Their result is substantial progress but does not prove pairwise negative correlation on every finite graph.

Current status (as of September 2026): The conjecture is established at q=1q=1, in several tree settings, and for the reported high-degree regular graph families; the unrestricted finite-graph case remains open.

Sources

Solutions 0

No solutions have been posted yet.