Measurable chromatic and independence numbers for ergodic graphs and group actions

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.