FIID homomorphisms and entropy inequalities
Combinatorics
2024-10-30 v2 Logic
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.
Keywords
Cite
@article{arxiv.2407.10006,
title = {FIID homomorphisms and entropy inequalities},
author = {Endre Csoka and Zoltan Vidnyanszky},
journal= {arXiv preprint arXiv:2407.10006},
year = {2024}
}