Unfriendly colorings of graphs with finite average degree
Unfriendly colorings of graphs with finite average degree
复制标题
具有有限平均度的图的不友好着色
DOI:
10.1112/plms.12345
复制
发表时间:
2020
影响因子:
1.8
通讯作者:
Tamuz, Omer
中科院分区:
文献类型:
--
作者:
Conley, Clinton T.;Tamuz, Omer
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.
登录
查看更多内容
DOI:
--
发表时间:
2014
期刊:
影响因子:
--
作者:
Clinton T. Conley
通讯作者:
Clinton T. Conley
DOI:
--
发表时间:
1990
期刊:
影响因子:
--
作者:
S. Shelah;E. C. Milner
通讯作者:
E. C. Milner
DOI:
--
发表时间:
1999
期刊:
影响因子:
--
作者:
A. Kechris;Slawomir Solecki;S. Todorcevic
通讯作者:
S. Todorcevic
影响因子:
0.8
作者:
E. Goles;J. Olivos
通讯作者:
J. Olivos