Negative association in uniform forests
Statement
Conjecture Let be a finite graph, let , and let be the edge set of a forest chosen uniformly at random from all forests of . Then
{\mathbb P}(e \in F \mid f \in F}) \le {\mathbb P}(e \in F)Record
- Source
- Added
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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.