Quadratic-size conjecture for k-blocked point sets
A finite point set in the plane is -blocked if its points are assigned one of colours such that two distinct points have the same colour exactly when some other point of the set blocks them. Quadratic-size conjecture. Every -blocked point set has points. The paper describes this as a strong conjecture; the largest known constructions are substantially smaller than quadratic, and no proof of the asserted upper bound is given.
References
- Greg Aloupis, Brad Ballinger, Sébastien Collette, Stefan Langerman, Attila Pór and David R. Wood, “Blocking Coloured Point Sets”, arXiv:1002.0190 (2010).
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.