Answer by Asinomás for Proving Erdős-Szekeres bound with counterexample
Take the sequence $\color{red}{r,r-1,r-2\dots 1},\color{blue}{2r,2r-1,2r-2\dots r+1} \dots \color{green}{rs,rs-1\dots (s-1)r+1} $If you want an increasing sequence you can't take two of the same color,...
View ArticleProving Erdős-Szekeres bound with counterexample
I want to find an example of a sequence of n=rs distinct numbers where there is not an increasing sequence of length s or a decreasing sequence of length r, hence showing that the bound given by...
View Article
More Pages to Explore .....
