On a question concerning prime distance graphs

AbstractLet D be a subset of the set P of prime numbers not containing any twin primes. Kemnitz and Kolberg raised the following question. For any given natural number n, are there only finitely many such minimal sets D, of the size n, such that the induced prime distance graph has chromatic number 4? In this paper, a conditional answer to this question based on a well-known conjecture from the prime number theory is given