Measurable chromatic and independence numbers for ergodic graphs and group actions (Q1943731): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
links / mardi / name | links / mardi / name | ||
Revision as of 15:52, 1 February 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Measurable chromatic and independence numbers for ergodic graphs and group actions |
scientific article |
Statements
Measurable chromatic and independence numbers for ergodic graphs and group actions (English)
0 references
20 March 2013
0 references
Summary: 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.
0 references
ergodic actions
0 references
Borel combinatorics
0 references
chromatic numbers
0 references
amenable groups
0 references
free groups
0 references