The coupon subset collection problem is a generalization of the classical coupon collecting problem, in that rather than collecting individual coupons we obtain, at each time point, a random subset of ...

First off, I'd like thank Magus, Evane, and tm for taking the time to help me yesterday. I have a better handle on the problem, but am still at a loss as to what to do.<BR><BR>Here's the situation.

We prove the independence of a strong partition relation on ℵ ω, answering a question of Erdos and Hajnal. We then give an almost complete answer to the free subset problem.