Panchromatic 3-coloring of a random hypergraph

The talk deals with colorings of random hypergraphs. A vertex 3-coloring is called panchromatic for a hypergraph H if every edge of H meets every color of 3 colors under this coloring. By using the second moment method we obtain very tight bounds for the probability threshold for the property that a random hypergraph in the binomial model admits a panchromatic 3-coloring.