3 problems
The edge-negative association conjecture. For every such graph , the random forest is edge-negatively associated. This is a longstanding problem concerning negative depen…
Update-stable zero-one conjecture. For every update-stable Borel set , the probability that belongs to is either zero or o…
Let be a weighted digraph, let be the complete graph with vertex set , and let be their Cartesian product. A rooted forest of has a -pro…