1. H. Croft: Incidence Incidents, Eureka 30 (1967), 22–26.
2. N. G. de Bruijn and P. Erdős: A colour problem for infinite graphs and a problem in the theory of relations, Nederl. Akad. Wetensch. Proc. Ser. A. 54 = Indagationes Math. 13 (1951), 369–373.
3. P. Erdős: Unsolved problems, Congressus Numerantium XV–Proceedings of the 5th British Combinatorial Conference. 1975, 681, 1976.
4. P. Erdős: Problems and results in combinatorial geometry, In Discrete geometry and convexity (New York, 1982), volume 440 of Ann. New York Acad. Sci., pages 1–11. New York Acad. Sci., New York, 1985.
5. F. M. de Oliveira Filho and F. Vallentin: Fourier analysis, linear programming, and densities of distance avoiding sets in Rn, Journal of the European Mathematical Society, 12 (2010), 1417–1428.