Ramsey Game Numbers

Let H be a graph and m a natural number. Consider the following Game, which is inspired by Ramsey Theory: Player I (blue) and Player II (red) alternate coloring edges of Km with their color. The first player to obtain a monochromatic H in his color wins. The Ramsey Game Number of H (denoted RG(H)) is the least m such that Player I has a winning strategy. We… CONTINUE READING