1 problem

Let $R_3(n;3,2)$ be the least integer $N$ such that every three-coloring of the edges of the complete three-uniform hypergraph $K_N^{(3)}$ contains a copy of $K_n^{(3)}$ using at m…