Forced convex subsets
Statement
Determine the exact Erdős–Szekeres number , the least number of planar points in general position forcing a convex -gon. Also determine sharp bounds for empty convex polygons; the source's former empty-hexagon subproblem has since been resolved.
Record
- Source
- Added
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.