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.
Comparing changes
Choose two branches to see what changed, then open a pull request to bring the work across.
Pick two different branches
A pull request can go from any branch into any other.