Indestructible colourings and rainbow Ramsey theorems
From MaRDI portal
Publication:3548503
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.
Recommendations
Cited in
(8)- Club-guessing, stationary reflection, and coloring theorems
- More results in polychromatic Ramsey theory
- Some results in polychromatic Ramsey theory
- Rainbow Ramsey theorems for colorings establishing negative partition relations
- scientific article; zbMATH DE number 5014483 (Why is no real title available?)
- Ramsey-Theory and Forcing Extensions
- Stationary and closed rainbow subsets
- scientific article; zbMATH DE number 2237565 (Why is no real title available?)
This page was built for publication: Indestructible colourings and rainbow Ramsey theorems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3548503)