Sub-Ramsey numbers of arithmetic progressions (Q582303)

A sub-k-coloring of 1,...,n is an assignment of colors to these numbers so that each color is used at most k-times. The number sr(m,k) is defined as the minimal such n that every sub-k-color of 1,...,n contains an arithmetic progression of m terms in which no two elements have the same color. Good upper and lower bounds for sr(m,k) are given.