Generalised Ramsey numbers for small graphs

AbstractThe generalised Ramsey number R(G1, G2,..., Gk) is defined as the smallest integer n such that, if the edges of Kn, the complete graph on n vertices, are coloured using k colours C1, C2,..., Ck, then for some i(1≤i≤k) there is a subgraph Gi of Kn with all of its edges colour Ci. When G1=G2=...,Gk=G, we use the more compact notation Rk(G).The generalised Ramsey numbers Rk(G) are investigated for all graphs G having at most four vertices (and no isolates). This extends the work of Chvátal and Harary, who made this investigation in the case k=2