Colorings of hypergraphs with large number of colors

The paper deals with the well-known problem of Erdős and Hajnal concerning colorings of uniform hypergraphs and some related questions. Let m(n,r)m(n,r) denote the minimum possible number of edges in an n-uniform non-r  -colorable hypergraph. We show that for r0C1>0 are some absolute constants.