加入
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).
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).
shoal-catalog changed this problem (d1cbb60b3b19). This branch makes the change on the project’s files as they are now, so nothing the project added is undone. Merge what still holds.