Negative association for up-events and edges in uniform spanning trees
Statement
Let be a finite connected graph, let be a uniform spanning tree, let be an edge, and let be an up-event, meaning an upwardly closed event in the space of subgraphs of , that ignores , meaning that for every subgraph one has if and only if . Negative-association conjecture.
This would strengthen the preceding pairwise negative-correlation theorem for edges of a uniform spanning tree. The source explicitly states that the truth or falsity of this assertion is unknown.
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.