Lesson 3

In the previous argument, everything is correct, but it only implies that \(R(3,3) \le 6\). To show that \(R(3,3)=6\), we also need to verify that there exists a graph with five vertices that contains neither a clique of size three nor an independent set of size three. Constructing such a graph is not difficult.