Measurable chromatic and independence numbers for ergodic graphs and group actions
Measurable chromatic and independence numbers for ergodic graphs and group actions
复制标题
遍历图和群作用的可测量色数和独立数
DOI:
--
复制
发表时间:
2013
期刊:
影响因子:
--
通讯作者:
A. Kechris
中科院分区:
文献类型:
--
作者:
Clinton T. Conley;A. Kechris
We study in this paper combinatorial problems concerning graphs generated by
measure preserving actions of countable groups on standard measure spaces. In particular
we study chromatic and independence numbers, in both the measure-theoretic and the Borel
context, and relate the behavior of these parameters to properties of the acting group such
as amenability, Kazhdan’s property (T), and freeness. We also prove a Borel analog of the
classical Brooks’ Theorem in finite combinatorics for actions of groups with finitely many
ends.