We construct a relatively thick subset of X, an arbitrary finite set of
integers, that does not contain k elements in arithmetic progression. The
thickness of the resulting sets depends on k and on the number of arithmetic
progressions in X.