The superlinear blocker conjecture with bounded collinearities

From papers

For fixed \ell, let b(n)b_\ell(n) be the minimum integer such that every set of nn points in the plane with no \ell collinear points can be blocked by a set of b(n)b_\ell(n) points. Bounded-collinearity blocker conjecture. For all fixed \ell,

b(n)nas n.\frac{b_\ell(n)}{n}\rightarrow\infty\quad\text{as }n\rightarrow\infty.

This generalizes the general-position case b3(n)=b(n)b_3(n)=b(n) and is stated in the source as implying the Big-Line-Big-Chromatic-Number Conjecture; its general status remains open.

Progress summary

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

Sources & referencesView supporting material

Primary source

Attila Pór and David R. Wood, “On Visibility and Blockers”, arXiv:0912.1150 (2009).

Solutions 0

No solutions have been posted yet.