Join
Leech trees beyond six vertices
Find an edge-weighted tree on more than six vertices whose pairwise path lengths are exactly 1, 2, …, n(n−1)/2, or prove that none exists.
Pull requests
Pull requests bring work from one route into another; merging one adopts it.