Distance graphs with finite chromatic number
Let \(D = \{ d_1, d_2, \ldots \} \) be a set of positive integers. Then the distance graph \(G(D)\) has as its vertex set the set of integers \(\mathbb{Z}\) and two vertices \(i, j\) are adjacent if and only if \( i-j \in D\). The authors show that if \(\inf\{d_{i+1}/d_i\} >1\), then the chromatic number of \(G(D)\) is finite. They also show that if \(\varepsilon_1 \geq \varepsilon_2 \geq \varepsilon_3 \geq\cdots\) is a sequence of positive reals tending to zero (arbitrarily slowly), then there is a distance set \(D = \{ d_1, d_2, \ldots \}\) where \(d _{i+1} \geq (1 + \varepsilon_i)d_i\) for all \(i = 1, 2, \ldots\) such that \(G(D)\) cannot be colored with a finite number of colors.
- Circular chromatic number of distance graphs with distance sets of cardinality 3
- Colouring the real line
- scientific article; zbMATH DE number 57114 (Why is no real title available?)
- Pattern periodic coloring of distance graphs
- The view-obstruction problem for \(n\)-dimensional cubes
- Zwei Sätze über inhomogene diophantische Approximation von Irrationalzahlen
- On types of growth for graph-different permutations
- On the chromatic number of circulant graphs
- Asymptotic clique covering ratios of distance graphs
- The lonely runner problem for lacunary sequences
- Distance graphs with large chromatic number and arbitrary girth
- On the time for a runner to get lonely
- Locating chromatic number of powers of paths and cycles
- Density modulo 1 of sublacunary sequences
- The packing coloring of distance graphs \(D(k,t)\)
- Colorings of the space \(\mathbb R^{n}\) with several forbidden distances
- Distance graphs with maximum chromatic number
- On \(S\)-packing colourings of distance graphs \(D (1, t)\) and \(D (1, 2, t)\)
- Coloring of n-dimensional distance graphs
- Coloring integral distance graphs with finite distance sets
- Some remarks on the lonely runner conjecture
- Coloring the real line with monochromatic intervals
- Distance graphs and arithmetic progressions
- Sum coloring of distance and circulant graphs
- ON DISTANCES IN CHROMATIC GRAPHS
- Two Erdős problems on lacunary sequences: chromatic number and Diophantine approximation
- Packing chromatic number of distance graphs
- scientific article; zbMATH DE number 1262797 (Why is no real title available?)
- Random runners are very lonely
- scientific article; zbMATH DE number 528072 (Why is no real title available?)
- Integral distance graphs
- On the Canonical Version of a Theorem in Ramsey Theory
- Biclique-colouring verification complexity and biclique-colouring power graphs
- Distance graphs from \(p\)-adic norms
- On the fractional parts of lacunary sequences
- Coloring distance graphs on the plane
- Chromatic coloring of distance graphs, III
- On some properties of accessible sets
- Improved Ramsey-type theorems for Fibonacci numbers and other sequences
- On the independence ratio of distance graphs
- Monochromatic paths for the integers
- An approximation property of lacunary sequences
- On a sequence related to that of Thue-Morse and its applications
This page was built for publication: Distance graphs with finite chromatic number
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1850605)
