Colorings of partial Steiner systems and their applications

This paper deals with extremal problems concerning colorings of partial Steiner systems. We establish a new sufficient condition for $r$-colorability of a hypergraph from some class of such systems in terms of maximum vertex degree. Moreover, as a corollary we obtain a new lower bound for the threshold probability for $r$-colorability of a random hypergraph in a binomial model.