Problem:
Let be a graph with one vertex for each positive integer . If , then an edge connects vertices and if and only if is a prime number. What is the chromatic number of ? Prove your answer.
Problem:
Let be a graph with one vertex for each positive integer . If , then an edge connects vertices and if and only if is a prime number. What is the chromatic number of ? Prove your answer.
Solution:
At least two colors are needed in a good coloring of . We show that two is sufficient. Write the positive integer as , for distinct primes , and let . Notice that if and are connected, then and have opposite parity. So, if we color red if is odd and blue otherwise, the two-coloring is good.