Partitions of large Rado graphs (Q834717)

For infinite cardinal numbers \(\kappa\) satisfying \(\kappa^{<\kappa}=\kappa\), the \(\kappa\)-Rado graph \(\mathcal{G}_{\kappa}\) is the graph whose vertex set is \(\kappa\) and which has the property that for all disjoint sets \(A,B\subseteq\kappa\), each of size \(<\kappa\), there is a vertex \(c\in\kappa\) such that there is an edge from \(c\) to each element of \(A\), but no edge to any element of \(B\). In the paper, models of ZFC are constructed in which there exists a measurable cardinal \(\kappa\) with the following property: For all integers \(m\geq 2\) there exists a positive integer \(r_m\) and a partition of \([\kappa]^m\) (the \(m\)-element subsets of \(\kappa\)) into \(r_m\) classes \(\langle C_i:0\leq i<r_m\rangle\), such that for any colouring of any of the classes \(C_j\) with fewer than \(\kappa\) colours, there is a subgraph \(\mathcal{G}^*=(V,E)\) of \(\mathcal{G}_{\kappa}\) which is isomorphic to \(\mathcal{G}_{\kappa}\), such that \([V]^m\cap C_j\) is monochromatic. As a consequence one gets that for any colouring of \([\kappa]^m\) with fewer than \(\kappa\) colours, there is a copy \(\mathcal{G}'=(V',E')\) of \(\mathcal{G}_{\kappa}\) such that \([V']^m\) has at most \(r_m\) colours.