ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Conjecture Let GG be a finite graph, let e,f∈E(G)e,f \in E(G), and let FF be the edge set of a forest chosen uniformly at random from all forests of GG. Then

{\mathbb P}(e \in F \mid f \in F}) \le {\mathbb P}(e \in F)

Record

Added
Links

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.