Given R(G, H) = n, we have the minimum number such that $K_n$ will always contain G in one color OR H in the other. Is this definition correct? I ask because I'm very confused about the particular wording. For example, if my definition is correct then there should exist a$K_{n-1}$ such that G is not present in one color AND H is not present in the other color.
Am I right so far?
Thanks in advance!