Indestructible colourings and rainbow Ramsey theorems
Abstract
We give a negative answer to a question of Erdos and Hajnal: it is consistent that GCH holds and there is a colouring c:[ω2]2 2 establishing ω2 [(ω1;ω)]22 such that some colouring g:[ω1]2 2 can not be embedded into c. It is also consistent that 2ω1 is arbitrarily large, and a function g establishes 2ω1 [(ω1,ω2)]2ω1 such that there is no uncountable g-rainbow subset of 2ω1. We also show that for each k∈ ω it is consistent with Martin's Axiom that the negative partition relation ω1 * [(ω1;ω1)]k-bdd holds.
0