Geodesic
The Solution to a Problem of Grünbaum
Canadian mathematical bulletin, Tome 31 (1988) no. 2, pp. 129-138

Voir la notice de l'article provenant de la source Cambridge University Press

The paper characterizes the set of all possible values for the number of lines determined by n points for n sufficiently large. For the lower bound of Kelly and Moser for the number of lines in a configuration with n — k collinear points is shown to be sharp and it is shown that all values between M min(k) and M max(k) are assumed with the exception of M max — 1 and M max — 3. Exact expressions are obtained for the lower end of the continuum of values leading down from In particular, the best value of c = 1 is obtained in Erdös’ previous expression for this lower end of the continuum.
DOI : 10.4153/CMB-1988-020-2
Mots-clés : 05-A15 
Salamon, Peter; Erdös, Paul. The Solution to a Problem of Grünbaum. Canadian mathematical bulletin, Tome 31 (1988) no. 2, pp. 129-138. doi: 10.4153/CMB-1988-020-2
@article{10_4153_CMB_1988_020_2,
     author = {Salamon, Peter and Erd\"os, Paul},
     title = {The {Solution} to a {Problem} of {Gr\"unbaum}},
     journal = {Canadian mathematical bulletin},
     pages = {129--138},
     year = {1988},
     volume = {31},
     number = {2},
     doi = {10.4153/CMB-1988-020-2},
     url = {http://geodesic.mathdoc.fr/articles/10.4153/CMB-1988-020-2/}
}
TY  - JOUR
AU  - Salamon, Peter
AU  - Erdös, Paul
TI  - The Solution to a Problem of Grünbaum
JO  - Canadian mathematical bulletin
PY  - 1988
SP  - 129
EP  - 138
VL  - 31
IS  - 2
UR  - http://geodesic.mathdoc.fr/articles/10.4153/CMB-1988-020-2/
DO  - 10.4153/CMB-1988-020-2
ID  - 10_4153_CMB_1988_020_2
ER  - 
%0 Journal Article
%A Salamon, Peter
%A Erdös, Paul
%T The Solution to a Problem of Grünbaum
%J Canadian mathematical bulletin
%D 1988
%P 129-138
%V 31
%N 2
%U http://geodesic.mathdoc.fr/articles/10.4153/CMB-1988-020-2/
%R 10.4153/CMB-1988-020-2
%F 10_4153_CMB_1988_020_2

[1] 1. Beck, J., On the lattice property of the plane and some problems of Dirac, Motzkin and Erdbs in combinatorial geometry, Combinatorica 3 (1983), pp. 281–297. Google Scholar

[2] 2. Cordovil, R., Europ. J. Math. 1 (1980), pp. 317–322. Google Scholar

[3] 3. Donald, J., Elwin, J., Hager, R. and Salamon, P., A graph theoretic bound on the permanent of a nonnegative matrix I & II, Lin. Alg. and Its Applic. 61 (1984), pp. 187–218. Google Scholar

[4] 4. Elliot, P. D. T. A., On the number of circles determined by n points, Acta Math. Acad. Sci. Hungar. 18 (1967), pp. 181–189. Google Scholar

[5] 5. Erdôs, P., On a problem of Grunbaum, Canad. Math. Bull. 15 (1972), pp. 23–25. Google Scholar

[6] 6. Grunbaum, B., Arrangements and spreads, Regional Conference Series in Mathematics, Number 10, Amer. Math. Soc. 1972. Google Scholar

[7] 7. Kelly, L. M. and Moser, W., On the number of ordinary lines determined by n points, Canad. J. Math. 10(1958), pp. 210–219. Google Scholar

[8] 8. Szemerédi, E. and Trotter, W. T. Jr., Extremal problems in discrete geometry, Combinatorica 3 (1983), pp. 381–392. Google Scholar

Cité par Sources :