ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GG be a (weighted) graph. Let F\mathcal{F} be the set of all spanning forests of GG, and let B\mathcal{B} be the probability distribution on spanning forests in which each forest has probability proportional to its weight. For two distinct edges e1,e2e_1,e_2 of GG, Grimmett–Winkler's spanning-forest correlation conjecture.

PrF∼B[e1∈F ∣ e2∉F]≥PrF∼B[e1∈F ∣ e2∈F].\mathrm{Pr}_{F\sim\mathcal{B}}[e_1\in F \:|\: e_2\not \in F] \geq \mathrm{Pr}_{F\sim\mathcal{B}}[e_1\in F \:|\: e_2\in F].

This is an analogue of the negative correlation inequality for spanning trees. It was stated by Grimmett and Winkler and is still open.

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 in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.