Hostname: page-component-586b7cd67f-rdxmf Total loading time: 0 Render date: 2024-11-25T04:06:05.021Z Has data issue: false hasContentIssue false
  • English
  • Français

Sets with No Empty Convex 7-Gons

Published online by Cambridge University Press:  20 November 2018

J. D. Horton
J. D. Horton*
Affiliation:
School of Computer Science, University of New Brunswick, FrederictonNew Brunswick, E3B 5A3
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the ‘Save PDF’ action button.

Erdös has defined g(n) as the smallest integer such that any set of g(n) points in the plane, no three collinear, contains the vertex set of a convex n-gon whose interior contains no point of this set. Arbitrarily large sets containing no empty convex 7-gon are constructed, showing that g(n) does not exist for n≥l. Whether g(6) exists is unknown.

Keywords

52A40Combinatorial geometryconvex polygon
Type
Research Article
Information
Canadian Mathematical Bulletin , Volume 26 , Issue 4 , 01 December 1983 , pp. 482 - 484
Copyright
Copyright © Canadian Mathematical Society 1983

References

1. Erdös, P. and Szekeres, G., A combinatorial problem in geometry, Compositio Math. 2 (1935), 463-470.Google Scholar
2. Erdös, P. and Szekeres, G., On some extremum problems in elementary geometry, Ann. Univ. Sci. Budapest 3–4 (1960-1) 53-62.Google Scholar
3. Harborth, H., Konvexe Funfecke in ebenen Punktmenger, Elem. Math. 33 (1978) 116-118.Google Scholar
4. Kalbfleisch, J. D., Kalbfleisch, J. G., and Stanton, R. G., A combinatorial problem on convex n-gons, Proc. Louisiana Conf. on Combinatorics Graph Theory, and Computing, Baton Rouge (1970), 180-188.Google Scholar
5. Moser, Wm., Research Problems in Geometry, McGill University, (1981) #29.Google Scholar