On four color monochromatic sets with nondecreasing diameter Original Research Article

Let m and r be positive integers. Define image to be the least positive integer N such that for every coloring of the integers image with r colors there exist monochromatic subsets image and image (not necessarily of the same color), each having m elements, such that (a) image, and (b) image. We improve previous upper bounds to determine that image.