On metric ramsey-type dichotomies

The classical Ramsey theorem states that every graph contains either a large clique or a large independent set. Here similar dichotomic phenomena are investigated in the context of finite metric spaces. Namely, statements are provided of the form 'every finite metric space contains a large subspace that is nearly equilateral or far from being equilateral'. Two distinct interpretations are considered for being 'far from equilateral'. Proximity among metric spaces is quantified through the metric distortion α. Tight asymptotic answers are provided for these problems. In particular, it is shown that a phase transition occurs at α = 2.