Ramsey numbers based on \(C_ 5\)-decompositions (Q1106242)

The authors compute several Ramsey numbers: \(r(C_ 4,K_ 3,K_ 3)=17\); \(r(C_ 4,C_ 4,C_ 4,G)\geq 16\); \(r(K_{2,3},K_{2,4})=12\); where \(C_ 4\) is the circuit of length four, \(K_ 3\) is the complete graph on three vertices, G denotes any connected graph on four or more vertices, and \(K_{2,i}\) is the complete bipartite graph with one vertex set containing two vertices and the other containing i vertices.