Journal of Symbolic Logic

Comparisons of polychromatic and monochromatic Ramsey theory

Justin Palumbo

Full-text: Access denied (no subscription detected)

We're sorry, but we are unable to provide you with the full text of this article because we are not able to identify you as a subscriber. If you have a personal subscription to this journal, then please login. If you are already logged in, then you may need to update your profile to register your subscription. Read more about accessing full-text


We compare the strength of polychromatic and monochromatic Ramsey theory in several set-theoretic domains. We show that the rainbow Ramsey theorem does not follow from ZF, nor does the rainbow Ramsey theorem imply Ramsey's theorem over ZF. Extending the classical result of Erdős and Rado we show that the axiom of choice precludes the natural infinite exponent partition relations for polychromatic Ramsey theory. We introduce rainbow Ramsey ultrafilters, a polychromatic analogue of the usual Ramsey ultrafilters. We investigate the relationship of rainbow Ramsey ultrafilters with various special classes of ultrafilters, showing for example that every rainbow Ramsey ultrafilter is nowhere dense but rainbow Ramsey ultrafilters need not be rapid. This entails comparison of the polychromatic and monochromatic Ramsey theorems as combinatorial principles on $\omega$.

Article information

J. Symbolic Logic, Volume 78, Issue 3 (2013), 951-968.

First available in Project Euclid: 6 January 2014

Permanent link to this document

Digital Object Identifier

Mathematical Reviews number (MathSciNet)

Zentralblatt MATH identifier


Palumbo, Justin. Comparisons of polychromatic and monochromatic Ramsey theory. J. Symbolic Logic 78 (2013), no. 3, 951--968. doi:10.2178/jsl.7803130.

Export citation