Distance Graphs with Finite Chromatic Nu
✍
I.Z. Ruzsa; Zs. Tuza; M. Voigt
📂
Article
📅
2002
🏛
Elsevier Science
🌐
English
⚖ 96 KB
The distance graph G(D) with distance set D={d 1 , d 2 , ...} has the set Z of integers as vertex set, with two vertices i, j ¥ Z adjacent if and only if |i -j| ¥ D. We prove that the chromatic number of G(D) is finite whenever inf{d i+1 /d i } > 1 and that every growth speed smaller than this admit