On some points-and-lines problems and configurations (Q2466326): Difference between revisions

This article is concerned with such problems as the ``orchard-planting problem'' that, given \(n\) and \(k\), looks for the maximum number \(r\) for which one can plant \(n\) trees so that there will be \(r\) straight rows with \(k\) trees in each row. In the author's own words, he studies ``some recent questions in incidence geometry'', namely a question raised by \textit{P. Brass} [Discrete geometry, Marcel Dekker, pp. 185--192 (2003; Zbl 1053.52021)], by applying ``an old method for constructing points-and-lines configurations in the plane''.