Solution

ID: past-exam-of-the-mathematics-course-of-the-university-of-cambridge/2010/ii/paper-1/17f/b/i/solution

A graph with vertices is a subgraph of . A monochromatic therefore contains a monochromatic copy of ; the copy need not be induced. Thus the preceding finite Ramsey theorem gives

New to topics? Read the docs here!