Indestructible colourings and rainbow Ramsey theorems
Logic
2008-04-30 v1 Combinatorics
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.
Keywords
Cite
@article{arxiv.0804.4548,
title = {Indestructible colourings and rainbow Ramsey theorems},
author = {Lajos Soukup},
journal= {arXiv preprint arXiv:0804.4548},
year = {2008}
}