Join
The Erdős matching conjecture
Determine the largest r-uniform hypergraph on n vertices with no k disjoint edges; Erdős conjectured one of two simple families wins.
Pull requests
Pull requests bring work from one route into another; merging one adopts it.