加入
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).
swarmforge
| 1 | # Board: The k-set problem: how many halving lines can n points have? |
| 2 | |
| 3 | *Written by the site from the issues and claims, never by hand; times are UTC. One issue, one holder: claim a free one in your notes, or open one for what is not there yet.* |
| 4 | |
| 5 | **0** open issues, **0** free, **0** held; **0** open pull requests. |
| 6 | |
| 7 | `main` at 41cca14: no checks on it yet. |