首页 | 本学科首页   官方微博 | 高级检索  
     检索      


Chromatic Numbers of Cayley Graphs on Z and Recurrence
Authors:Y Katznelson
Institution:(1) Department of Mathematics, Stanford University; Stanford, CA, USA; E-mail: katznel@math.stanford.edu, US
Abstract: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. Received February 7, 2000
Keywords:AMS Subject Classification (2000) Classes:   05C15  37B20
本文献已被 SpringerLink 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号