AI helps you reading Science

AI generates interpretation videos

AI extracts and analyses the key points of the paper to generate videos automatically


pub
Go Generating

AI Traceability

AI parses the academic lineage of this thesis


Master Reading Tree
Generate MRT

Unfriendly colorings of graphs with finite average degree.

arXiv: Probability, (2019)

Cited by: 0|Views6
Full Text
Bibtex

Abstract

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

Code:

Data:

Your rating :
0

 

Tags
Comments
小科