Sets with no empty convex 7-gons

Simple item page
dc.contributor.authorHorton, J., D.
dc.date.accessioned2023-03-01T18:29:23Z
dc.date.available2023-03-01T18:29:23Z
dc.date.issued1982
dc.description.abstractErdos 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 > 7. Whether g(6) exists is unknown.
dc.description.copyrightCopyright @ J. D. Horton, 1982.
dc.identifier.urihttps://unbscholar.lib.unb.ca/handle/1882/14921
dc.rightshttp://purl.org/coar/access_right/c_abf2
dc.subject.disciplineComputer Science
dc.titleSets with no empty convex 7-gons
dc.typetechnical report

Files

Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
item.pdf
Size:
94.54 KB
Format:
Adobe Portable Document Format
Download

Collections

Research Reports