Unfriendly colorings of graphs with finite average degree
arXiv: Probability, 2019.
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 B...More
PPT (Upload PPT)