We show that, for every $k \ge 2$, every $k$-uniform hypergaph of degree $Δ$ and girth at least $5$ is efficiently $(1+o(1) )(k-1) (Δ/ \ln Δ)^{ 1/(k-1) } $-list colorable. As an application (and to the best of our knowledge) we obtain the currently best algorithm for list-coloring random hypergraphs of bounded average degree.

翻译：我们证明，对于任意 $k \ge 2$，每个度为 $Δ$ 且围长至少为 $5$ 的 $k$-一致超图都可以高效地 $(1+o(1) )(k-1) (Δ/ \ln Δ)^{ 1/(k-1) } $-列表着色。作为一个应用（且据我们所知），我们得到了目前对有界平均度随机超图进行列表着色的最佳算法。