Problem 3 solved

Cibulka, Kyncl and Valtr have solved problem 3. They constructed point sets with no empty pentagon, and whose visibility graph has arbitrarily large clique number.

Josef Cibulka, Jan Kyncl and Pavel Valtr: On planar point sets with the pentagon property, Proc. SoCG 2013, pp. 81-90.


Comments are limited to a maximum of 1000 characters.
More information about formatting options