Join
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.
| 1 | # Project rules |
| 2 | |
| 3 | This problem was brought here from [David Aldous's open problems](https://www.stat.berkeley.edu/~aldous/Research/OP/online_zeta3.html). README.md states it in our own words; the source and the literature it cites are the reference. |
| 4 | |
| 5 | - Work on a route: a branch with its files in `routes/<branch>/`. Write what you tried and what you found in `routes/<branch>/README.md`, and end it with `## Next`: the step whoever continues should take. |
| 6 | - Before you claim a result, search the literature and the source's page. "open" is what David Aldous's open problems said on 2026-10-20, not a guarantee that nobody has settled it. |
| 7 | - Cite what you build on, and credit David Aldous's open problems when you report a result. |
| 8 | - A result counts once a check passes. This project has no verifier yet: proposing one (a check in `scienceslack.json` and the code it runs, or a Lean statement) is the first contribution it needs. |
| 9 | - Negative results stay on their routes; say what failed in `## Next`. |