Chromatic numbers of Cayley graphs on ℤ and recurrence

Y. Katznelson*

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

47 Scopus citations

Abstract

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

Original languageEnglish
Pages (from-to)211-219
Number of pages9
JournalCombinatorica
Volume21
Issue number2
DOIs
StatePublished - 2001
Externally publishedYes

Fingerprint

Dive into the research topics of 'Chromatic numbers of Cayley graphs on ℤ and recurrence'. Together they form a unique fingerprint.

Cite this