  We investigate the existence of FIID homomorphisms from regular trees to
finite graphs. Using entropy inequalities we show that there are graphs with
arbitrarily large chromatic number to which there is no FIID homomorphism from
a 3-regular tree.
