This mini-course will cover a range of topics related to random minimum spanning trees and, to a lesser extent, uniform spanning trees. It is possible the below lecture plan will be adjusted, either to cover necessary background material, or as a function of the interests of the audience.

- Day 3: Minimum spanning forests on infinite graphs. Free versus wired MSFs. When is the MSF a tree. The wired MSF of the Poisson-Weighted Infinite Tree. A hint of Frieze's zeta(3) limit.