Skip to main content
SpringerLink
Log in

Chromatic Numbers of Cayley Graphs on Z and Recurrence

  • Original Paper
  • Published:
Combinatorica Aims and scope Submit manuscript

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, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

Author information

Authors and Affiliations

  1. Department of Mathematics, Stanford University; Stanford, CA, USA; E-mail: katznel@math.stanford.edu, , , , , , US

    Y. Katznelson

Authors
  1. Y. Katznelson
    View author publications

    You can also search for this author in PubMed Google Scholar

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

  • Issue Date:

  • DOI: https://doi.org/10.1007/s004930100019

Search

Navigation