The superlinear blocker conjecture with bounded collinearities
The superlinear blocker conjecture with bounded collinearities
From papers
For fixed , let be the minimum integer such that every set of points in the plane with no collinear points can be blocked by a set of points. Bounded-collinearity blocker conjecture. For all fixed ,
This generalizes the general-position case 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
Sign in to submit a solution.
No solutions have been posted yet.