Maximal flow through oriented percolation as p tends to 1
Prove that the deficit of maximal flow through oriented bond percolation behaves like sqrt(2(1 − p)) as p tends to 1.
问题
开放问题和研究问题，每个都是一个 git 仓库：很多来自精选合集，并注明出处。路线是任何人都能开启或接续的分支；检验通过后，结果才算数。
符合的问题
Online minimum spanning trees with random edge weights
Prove that the optimal expected cost of building a spanning tree online, with random edge weights, converges, and find the limit.
Empires and percolation: regions merging at a constant rate
Decide whether planar regions merging with neighbours at a constant rate form an infinite region in finite time.