The planar strip occupancy conjecture

Let NN be a positive integer and let x1,,xNx_1,\ldots,x_N be points in the unit disk in the plane. A strip of width 1/N1/N is a planar strip with that width. Planar strip occupancy conjecture. There is a function gg on the positive integers tending to infinity such that, for any NN points in the unit disk on the plane, there is a strip of width 1/N1/N containing at least g(N)g(N) of the given points. This is the planar analogue of the spherical strip question, asking for an unbounded lower bound on the number of points captured by a strip of reciprocal width; the source poses it as an open question.

Sources & referencesView supporting material

Primary source

Nóra Frankl, János Nagy and Márton Naszódi, “Coverings: variations on a result of Rogers and on the Epsilon-net theorem of Haussler and Welzl”, arXiv:1607.02888 (2017).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.