paper

Indestructible colourings and rainbow Ramsey theorems

arXiv:0804.4548

Abstract

We give a negative answer to a question of Erdos and Hajnal: it is consistent that GCH holds and there is a colouring establishing such that some colouring can not be embedded into . It is also consistent that is arbitrarily large, and a function establishes such that there is no uncountable -rainbow subset of . We also show that for each it is consistent with Martin's Axiom that the negative partition relation holds.

Indestructible colourings and rainbow Ramsey theorems · wovepaper