# 2.9 Coloring & Connectivity

## Connected Components Among the Integers

Let $$g$$ be the graph whose vertices are the integers, where an edge exists between every pair of vertices $$i$$ and $$j$$ iff $$|i-j|=6$$.

1. How many connected components does $$g$$ have?

Exercise 1