A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is `application/pdf`

.

##
###
Phase transitions in the q-coloring of random hypergraphs

2017
*
Journal of Physics A: Mathematical and Theoretical
*

We study in this paper the structure of solutions in the random hypergraph coloring problem and the phase transitions they undergo when the density of constraints is varied. Hypergraph coloring is a constraint satisfaction problem where each constraint includes $K$ variables that must be assigned one out of $q$ colors in such a way that there are no monochromatic constraints, i.e. there are at least two distinct colors in the set of variables belonging to every constraint. This problem

doi:10.1088/1751-8121/aa9529
fatcat:qahzk2p7ereqjc5pt5voagvabe