Colorings v.s. list colorings of uniform hypergraphs

Wei Wang, Jianguo Qian, Zhidan Yan

Let $r$ be an integer with $r\ge 2$ and $G$ be a connected $r$-uniform hypergraph with $m$ edges. By refining the broken cycle theorem for hypergraphs, we show that if $k>\frac{m-1…