# Szemerédi–Trotter type problem

Given $n$ points and an integer $k ≥ 2.$ What is the maximum number of unit circles which pass through at least $k$ of the points?

I think the answer is $O(n^{4/3}/k),$ but I'm not really sure. Any ideas?