MathNet 2009-part-05 — 172 problems (EN–VI) Question 138

Let $T$ be a graph with one vertex $v_{n}$ for every integer $n$. An edge connects $v_{a}$ and $v_{b}$ if $|a-b|$ is a power of two. What is the chromatic number of $T$? Prove your answer.