Ramsey numbers in octahedron graphs (Q5937591)

For \(t\)-colorings of the octahedron graph with \(2n\) vertices, \(O_n=K_{2n}-nK_2\), the octahedron Ramsey number \(r_O(G_1,\ldots,G_t)\) is defined as the smallest integer \(n\) such that any \(t\)-coloring of the edges of \(O_n\) contains a monochromatic copy of \(G_i\) for some color \(i\). Lower and upper bounds for octahedron Ramsey numbers with respect to the classical Ramsey numbers are presented. It is shown that all values between the lower and upper bound are attained for certain classes of graphs. Moreover, the values of \(r_O(G_1,G_2)\) are listed for all graphs \(G_1\) and \(G_2\) with at most four vertices.