- Record: found
- Abstract: found
- Article: found
FIID homomorphisms and entropy inequalities
Preprint
13 July 2024
Read this article at
There is no author summary for this article yet. Authors can add summaries to their articles on ScienceOpen to make them more accessible to a non-specialist audience.
Abstract
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.