Unfriendly colorings of graphs with finite average degree

被引：3
|
作者：
Conley, Clinton T. [1 ]
Tamuz, Omer [2 ]
机构：
[1] Carnegie Mellon Univ, Dept Math Sci, 7121 Wean Hall,5000 Forbes Ave, Pittsburgh, PA 15213 USA
[2] CALTECH, 1200 E Calif Blvd, Pasadena, CA 91125 USA
来源：
PROCEEDINGS OF THE LONDON MATHEMATICAL SOCIETY | 2021年 / 122卷 / 02期
关键词：
54H05; (primary);
D O I：
10.1112/plms.12345
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
In an unfriendly coloring of a graph the color of every node mismatches that of the majority of its neighbors. We show that every probability measure preserving Borel graph with finite average degree admits a Borel unfriendly coloring almost everywhere. We also show that every bounded degree Borel graph of subexponential growth admits a Borel unfriendly coloring.
引用
收藏
页码：229 / 233
页数：5
相关论文
共 50 条
12345