Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. Join them; it only takes a minute:

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

Does anyone know any specific or explicit example of a set of $256$ points so that no $10$ are the vertices of a convex $10$-gon? Thanks in advance.

share|cite|improve this question
It seems that Erdos and Szekeres claimed an inductive construction for an example, but it is based on $g_{k,1}(1)=g_{1,l}=0$ and $g_{k,l}$ linearly depends on $g_{k,1}(1)$ and $g_{1,l}(1)$, which means all $g_{k,l}$'s are $0$. But then how would that become a valid example? Anyone knows? Thanks. – alicay Jan 10 '13 at 8:03
If the one who edited the question is the same as the OP, he should flag for moderator attention to request merging his two accounts. – Julian Kuelshammer Jan 10 '13 at 21:03

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.

Browse other questions tagged or ask your own question.