Erdős' problem and $(n,\frac{1}{3})$-separated sets

Abstract

Inspired by the Erdős' problem in Ramsey theory, we propose a dynamical version of the problem and answer it positively for circle maps.

We find a very simple proof of the main problem in the manuscript. So, we feel the idea in the manuscript is of no help to combinatorics