Negative correlation conjecture for uniformly random spanning forests
Statement
Let be a graph, and let be a uniformly random forest chosen from all forests of . For edges , negative correlation conjecture.
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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.