English

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 c:[ω2]22c:[{\omega_2}]^2\to 2 establishing ω2↛[(ω1;ω)]22\omega_2 \not\to [(\omega_1;{\omega})]^2_2 such that some colouring g:[ω1]22g:[\omega_1]^2\to 2 can not be embedded into cc. It is also consistent that 2ω12^{\omega_1} is arbitrarily large, and a function gg establishes 2ω1↛[(ω1,ω2)]ω122^{\omega_1} \not\to [(\omega_1,\omega_2)]^2_{\omega_1} such that there is no uncountable gg-rainbow subset of 2ω12^{\omega_1}. We also show that for each kωk\in {\omega} it is consistent with Martin's Axiom that the negative partition relation ω1̸[(ω1;ω1)]kbdd\omega_1 \not\to^* [(\omega_1;\omega_1)]_{k-bdd} 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}
}
R2 v1 2026-06-21T10:35:28.261Z