Fractional chromatic number of distance graphs generated by two-interval sets

Let DD be a set of positive integers. The distance graph generated by DD, denoted by G(Z,D)G(Z,D), has the set ZZ of all integers as the vertex set, and two vertices xx and yy are adjacent whenever |x−y|∈D|x−y|∈D. For integers 1