A graph is -Ramsey if every two-coloring of its edges contains a monochromatic copy of . Define the -Ramsey number of , denoted by , to be the minimum number of copies of in a graph which is -Ramsey. This generalizes the Ramsey number and size Ramsey number of a graph. Addressing a question of Spiro, we prove that for all sufficiently large . Our proof involves a combination of results on the chromatic number of triangle-sparse graphs.
