Abstract
We consider a set X of n noncollinear points in the Euclidean plane, and the set of lines spanned by X, where n is an integer with n ≥ 3. Let t(X) be the maximum number of lines incident with a point of X. We consider the problem of finding a set X of n noncollinear points in the Euclidean plane with \({t(X) \le \lfloor n/2 \rfloor}\), for every integer n ≥ 8. In this paper, we settle the problem for every integer n except n = 12k + 11 (k ≥ 4). The latter case remains open.
Similar content being viewed by others
References
Dirac G.A.: Collinearity properties of sets of points. Quart. J. Math. 2, 221–227 (1951)
Grünbaum, B.: Arrangements and spreads, Conference Board of the Mathematical Sciences, Regional Conference Series in Mathematics, No. 10, Amer. Math. Soc. (1972)
Grünbaum B.: A catalogue of simplicial arrangements in the real projective plane. Ars Mathematica Contemporanea 2, 1–25 (2009)
Grünbaum, B.: Dirac’s conjecture concerning high-incidence elements in aggregates, to appear in Geombinatorics
Klee, V., Wagon, S.: Old and new unsolved problems in plane geometry and number theory, The Mathematical Association of America (1991)
Brass P., Moser W., Pach J.: Research problems in discrete geometry, 1st edn. Springer, Berlin (2005)
Coxeter H.S.M.: Projective geometry, 2nd edn. Springer, Berlin (1987)
Author information
Authors and Affiliations
Corresponding author
Additional information
This research was supported in part by Grand-in-Aid for Scientific Research (C).
Rights and permissions
About this article
Cite this article
Akiyama, J., Ito, H., Kobayashi, M. et al. Arrangements of n Points whose Incident-Line-Numbers are at most n/2. Graphs and Combinatorics 27, 321–326 (2011). https://doi.org/10.1007/s00373-011-1023-4
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00373-011-1023-4