On a correlational clustering of integers

Let AA be a finite set, and let a symmetric binary relation be given on AA. The goal of correlation clustering is to find a partition of AA, with minimal conflicts with respect to the relation given. In this paper we investigate correlation clustering of subsets of the positive integers, based upon a relation defined by the help of the greatest common divisor.