Measure-theoretic unfriendly colorings

FUNDAMENTA MATHEMATICAE(2014)

引用 2|浏览1
暂无评分
摘要
We consider the problem of finding a measurable unfriendly partition of the vertex set of a locally finite Borel graph on standard probability space. After isolating a sufficient condition for the existence of such a partition, we show how it settles the dynamical analog of the problem (up to weak equivalence) for graphs induced by free, measure-preserving actions of groups with designated finite generating set. As a corollary, we obtain the existence of translation-invariant random unfriendly colorings of Cayley graphs of finitely generated groups.
更多
查看译文
关键词
unfriendly partitions,Borel combinatorics,weak equivalence
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要