On a problem concerning integer distance graphs

Janka Oravcová, Roman Soták

For $D$ being a subset of positive integers, the integer distance graph is the graph $G(D)$, whose vertex set is the set of integers, and edge set is the set of all pairs $uv$ with…