Join
The k-set problem: how many halving lines can n points have?
Find the maximum number of k-sets and halving lines of n points in the plane; the known bounds are barely superlinear and O(n^4/3).
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.