ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GG be a graph, and let F\mathbf{F} be a uniformly random forest chosen from all forests of GG. For edges e,f∈E(G)e,f\in E(G), negative correlation conjecture.

P(e,f∈F)≤P(e∈F)P(f∈F).\mathbb{P}(e,f\in \mathbf{F})\leq \mathbb{P}(e\in \mathbf{F})\mathbb{P}(f\in \mathbf{F}).

This conjecture asks whether edge inclusion events are negatively correlated for a uniformly random spanning forest. The source describes it as a well-known open problem and notes that it implies the regular-graph spanning-forest bound above.

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.