, Volume 3, Issue 3-4, pp 281-297

On the lattice property of the plane and some problems of Dirac, Motzkin and Erdős in combinatorial geometry

Rent the article at a discount

Rent now

* Final gross prices may vary according to local VAT.

Get Access


LetS be a set ofn non-collinear points in the Euclidean plane. It will be shown here that for some point ofS the number ofconnecting lines through it exceedsc · n. This gives a partial solution to an old problem of Dirac and Motzkin. We also prove the following conjecture of Erdős: If any straight line contains at mostn−x points ofS, then the number of connecting lines determined byS is greater thanc · x · n.

Dedicated to Paul Erdős on his seventieth birthday