The Internet Archive has a preservation copy of this work in our general collections.
The file type is
Given an r-uniform hypergraph H, the multicolor Ramsey number r_k(H) is the minimum n such that every k-coloring of the edges of the complete r-uniform hypergraph K_n^r yields a monochromatic copy of H. We investigate r_k(H) when k grows and H is fixed. For nontrivial 3-uniform hypergraphs H, the function r_k(H) ranges from √(6k)(1+o(1)) to double exponential in k. We observe that r_k(H) is polynomial in k when H is r-partite and at least single-exponential in k otherwise. Erdős, Hajnal andarXiv:1302.5304v1 fatcat:3gihbc3webai5koy7sjwjdu5r4