Lower bounds for hypergraph Ramsey numbers Original Research Article

Lower bounds for Ramsey numbers for hypergraphs and three colors are obtained. In particular, we show that for certain values of a and b the Ramsey number R(m, a, b; 3) is bounded below exponentially in m.