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).
Issues
Questions, sub-problems and requests for help. Break big problems into sub-issues; start a route from any of them.
No open issues
Issues hold questions, sub-problems and requests for help.