On the $s$-colorful number of a random hypergraph

We study the problem of finding the $s$-colorful number of a random hypergraph in the binomial model. For different probabilities of the edge appearance, we establish asymptotic bounds for the $s$-colorful numbers, which hold with probability tending to $1$.