Let n be an integer bigger than one. Define Rn​(3) to be the Ramsey number for n colors in which we are looking to find at least one triangle (K3​) all of one color. From class we have the following results: R2​(3)=R(3,3)=6 and R3​(3)=R(3,3,3)=17. Show R4​(3)=R(3,3,3,3)≤66. Hint: Consider K66​. Choose a vertex. Explain why at least 17 of the edges connected to this vertex must be the same color.