MathOverflow is a question and answer site for professional mathematicians. Join them; it only takes a minute:

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

Given $c<\infty$ colors, positive integers $k_1,\dots,k_n$ and positive integers $N_1,\dots,N_n$. Then there exist positive integers $M_1,\dots,M_n$ so that for disjoint finite sets $A_1,\dots,A_n$ of cardinalities $|A_i|=M_i$, $1\leq i\leq n$, the following statement holds:

assume that each array $(B_1,\dots,B_n)$, where $B_i\subset A_i$ and $|A_i|=k_i$ is colored in one of our $c$ colors. Then there always exist sets $C_i\subset A_i$, $|C_i|=N_i$, so that colors of arrays satisfying $B_i\subset C_i$ are all the same.

This follows from the usual Ramsey theorem by straightforward induction, but maybe it is well known statement itself?

share|cite|improve this question
up vote 2 down vote accepted

This is indeed well known, although I can't give a reference where it is stated in this exact form. If I see right, Theorem 49 of Erdos-Rado: A partition calculus in set theory, Bull. Amer. Math. Soc. 62 (1956), 427--489 (available as is at least very close to it. R. Rado: Direct decompositions of partitions, Journal of Lon. Math. Soc 29(1954), 71-83. may contain the theorem, but I don't have access to it. See J.Larson: Infinite Combinatorics, Handbook of the History of Logic, vol 6, p. 215.

share|cite|improve this answer

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.

Not the answer you're looking for? Browse other questions tagged or ask your own question.