加载中…
2024-07-13
FIID homomorphisms and entropy inequalities
Endre CsokaZoltan Vidnyanszky
文献摘要
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.
讨论
0讲解博客
生成讲解博客的中文版本
AI智能校验
生成AI智能校验的中文版本