  We show that, for every $\epsilon>0$, the 4-regular tree has an fiid
4-coloring where a given vertex is assigned the 4th color with probability at
most $\epsilon$. We also construct 5-colorings of $T_6$ improving known bounds
on the measurable and approximate chromatic number of $F_3$.
