Finitely dependent random colorings of bounded degree graphs

Ádám Timár

We prove that every (possibly infinite) graph of degree at most $d$ has a 4-dependent random proper $4^{d(d+1)/2}$-coloring, and one can construct it as a finitary factor of iid. F…