Hypergraphs with high chromatic number (Q1086588)

Let f(k,s) denote the minimal number of edges of a k-uniform hypergraph whose chromatic number is at least s. In this paper a conjecture made by \textit{P. Erdős} and \textit{A. Hajnal} [Acta Math. Acad. Sci. Hung. 12, 87-123 (1961; Zbl 0201.328)] which asserts that for every fixed \(k\geq 2\), if \(s>s_ 0(k)\) then \(f(k,s)=\left( \begin{matrix} (s-1)(k-1)+1\\ k\end{matrix} \right)\) holds is disproved. The author also proves that for every fixed k f(k,s)\(=\Omega (s^ k)\) as \(s\to \infty\) and proposes the following conjecture: for every fixed k the limit \(\lim_{s\to \infty}f(k,s)/s^ k\) exists.