Randomly colouring simple hypergraphs

Alan Frieze, Pall Melsted

We study the problem of constructing a (near) random proper $q$-colouring of a simple k-uniform hypergraph with n vertices and maximum degree Δ. (Proper in that no edge is mono-col…