On the lattice property of the plane and some problems of Dirac, Motzkin and Erdős in combinatorial geometry
- 240 Downloads
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.
AMS subject classification (1980)51 M 05 05 C 35
Unable to display preview. Download preview PDF.
- J. Beck andJ. Spencer, Unit distances, submitted toJournal of Combinatorial Theory, Series A (1982)Google Scholar
- P. Erdős, Some applications of graph theory and combinatorial methods to number theory and geometry,Colloquia Math. Soc. János Bolyai, Algebraic methods in graph theory, Szeged (Hungary) (1978) 137–148.Google Scholar
- B. Grünbaum,Arrangements and spreads, Regional Conference Series in Mathematics 10, Amer. Math. Soc., 1972.Google Scholar
- E. Jucovič, Problem 24,Combinatorial structures and their applications, Gordon and Breach, New York, 1970.Google Scholar
- W. Moser,Research problems in discrete geometry, Mimeograph notes, 1981.Google Scholar