Problem #WSP-000484

Problems Graph theory

Problem

Show that R(4,3)9. That is, there exists a way of colouring the edges of K8 with no red K4, nor any blue K3.