Proof of the Finiteness of the Chromatic Number of Two-Dimensional Lacunary Distance Graphs
The authors extend the one-dimensional lonely set method to two dimensions to study the chromatic number of integer distance graphs in two dimensions.
The authors provide a new proof of the existence of a finite chromatic number for integer distance graphs in two dimensions, which is a novel contribution to the field of graph theory.
Before reading this…
To understand this paper, make sure you know these concepts first:
- graph theoryfind papers →
- lacunary sequencesfind papers →
Abstract
More Like ThisWe extend the one-dimensional lonely set method to two dimensions for the purpose of studying the chromatic number of integer distance graphs in two dimensions. Given a lacunary sequence of displacement vectors in $Z^{2}$, we use a lacunary matrix theorem given by Broderick, Fishman and Kleinbock, to prove the existence of a satisfactory multiplier vector. We then give an explicit geometric colouring argument. This proves that any integer distance graph generated by a lacunary sequence of vectors in two dimensions has finite chromatic number.