Paul Erdo ̋s’s Empty Hexagon Problem asks if there exists a number H(6) such that for all sets of n ≥ H points in general position on the plane six of the points form the vertices of an empty convex hexagon. This problem is open.
Identifer | oai:union.ndltd.org:CLAREMONT/oai:scholarship.claremont.edu:hmc_theses-1168 |
Date | 01 December 2003 |
Creators | Nelson, Jessica |
Publisher | Scholarship @ Claremont |
Source Sets | Claremont Colleges |
Detected Language | English |
Type | text |
Format | application/pdf |
Source | HMC Senior Theses |
Page generated in 0.002 seconds