Improved bounds for randomly colouring simple hypergraphs

Weiming Feng, Heng Guo, Jiaheng Wang

We study the problem of sampling almost uniform proper $q$-colourings in $k$-uniform simple hypergraphs with maximum degree $\Delta$. For any $\delta >0$, if $k\ge \frac{20(1+\delta )}{\delta }$ and $q \…