Chromatic Numbers of Cayley Graphs on Z and Recurrence

Dedicated to the memory of Paul Erdős

In 1987 Paul Erdős asked me if the Cayley graph defined on Z by a lacunary sequence has necessarily a finite chromatic number. Below is my answer, delivered to him on the spot but never published, and some additional remarks. The key is the interpretation of the question in terms of return times of dynamical systems.

This is a preview of subscription content, access via your institution.

Author information

Affiliations

Authors

Additional information

Received February 7, 2000

Rights and permissions

Reprints and Permissions

About this article

Cite this article

Katznelson, Y. Chromatic Numbers of Cayley Graphs on Z and Recurrence. Combinatorica 21, 211–219 (2001). https://doi.org/10.1007/s004930100019

Download citation

  • AMS Subject Classification (2000) Classes:  05C15, 37B20