We will discuss several ramsey-type results in combinatorics on words. In one of the results, it is proved that the existence of powers or anti-powers is an unavoidable regularity for sufficiently long words. An abelian version, where we count the frequency of each letter, is conjectured to be true and reveals a surprising connection with the factor complexity function of infinite word.
