Ramsey properties of families of graphs (Q1403930)

The paper discusses Ramsey properties for \(r\)-colorings of a graph \(F\) and families of complete graphs \(K_{a_1},\dots,K_{a_r}\) (\(a_1,\dots,a_r\) are arbitrary natural numbers): Generalizing the arrow notation where \(F\rightarrow(a_1,\dots,a_r)\) denotes the fact that every \(r\)-coloring of the edges of \(F\) with \(r\) colors contains a monochromatic copy of \(K_{a_i}\) in at least one color, \((a_1,\dots,a_r)\rightarrow(b_1,\dots,b_s)\) denotes the fact that for every graph \(F\) for which \(F\rightarrow(a_1,\dots,a_r)\) it holds also that \(F\rightarrow(b_1,\dots,b_s)\). It is shown that the relation \((a_1,\dots,a_r)\rightarrow(b_1,\dots,b_s)\) can be decomposed into a set of relations of the type \((a_i)\rightarrow(b_j)_{j\in A_i}\), where \(A_1,\dots,A_r\) is a partition of the set \(\{1,\dots,s\}\). Several open problems and remarks based on this result are formulated.