Given a finite point set P in the plane, a subset S⊆P is called an island in P if conv(S) ⋂ P = S. We say that S ⊂ P is a visible island if the points in S are pairwise visible and S is an island in P. The famous Big-line Big-clique Conjecture states that for any k ≥ 3 and l ≥ 4, there is an integer n = n(k, l), such that every finite set of at least n points in the plane contains l collinear points or k pairwise visible points. In this paper, we show that this conjecture is false for visible islands, by replacing each point in a Horton set by a triple of collinear points. Hence, there are arbitrarily large finite point sets in the plane with no 4 collinear members and no visible island of size 13.
A. Abel , B. Ballinger , P. Bose , S. Collette , V. Dujmovic , F. Hurtado , S. D. Kominers , S. Lan-german , A. Pór and D. Wood . Every large point set contains many collinear points or an empty pentagon. Graphs and Combinatorics, 27:47-60, 2011.
J. D. Horton . Sets with no empty convex 7-gons. Canad. Math. Bull., 26:482-484, 1983.
J. Kára , A. Pór and D. Wood . On the chromatic number of the visibility graph of a set of points in the plane. Discrete Comput. Geom., 34:497-506, 2005.
J. Matousek . Blocking Visibility for Points in General Position. Discrete Comput Geom, 42:219-223, 2009.
J. Matousek . Lectures on Discrete Geometry. Springer-Verlag, New York, 2002.
A. Pór and D. Wood . On visibility and blockers. J. Comput. Geom., 1:29-40, 2010.