On Generalized Ramsey Numbers for 3-Uniform Hypergraphs
The well-known Ramsey number is the smallest integern such that every -free graph of ordern contains an independent set of sizeu. In other words, it contains a subset of uvertices with noK2. Erd?s and Rogers introduced a more general problem replacingK2 by for . Extending the problem of determining Ramsey numbers they defined the numbers
ramsey numbers hypergraphs