eng
Schloss Dagstuhl – Leibniz-Zentrum für Informatik
Leibniz International Proceedings in Informatics
1868-8969
2015-06-12
405
405
10.4230/LIPIcs.SOCG.2015.405
article
The Dirac-Motzkin Problem on Ordinary Lines and the Orchard Problem (Invited Talk)
Green, Ben J.
Suppose you have n points in the plane, not all on a line. A famous theorem of Sylvester-Gallai asserts that there is at least one ordinary line, that is to say a line passing through precisely two of the n points. But how many ordinary lines must there be? It turns out that the answer is at least n/2 (if n is even) and roughly 3n/4 (if n is odd), provided that n is sufficiently large. This resolves a conjecture of Dirac and Motzkin from the 1950s. We will also discuss the classical orchard problem, which asks how to arrange n trees so that there are as many triples of colinear trees as possible, but no four in a line. This is joint work with Terence Tao and reports on the results of [Green and Tao, 2013].
https://drops.dagstuhl.de/storage/00lipics/lipics-vol034-socg2015/LIPIcs.SOCG.2015.405/LIPIcs.SOCG.2015.405.pdf
combinatorial geometry
incidences