Open Problems Column Edited by William Gasarch This Issue's Column!

In this column we state a class of open problems in Ramsey Theory. The general theme is to take Ramsey-type statements that are false and weaken them by allowing the homogenous set to use more than one color. This concept is not new, and the theorems we state and/or prove are not new; however, the open questions that request easier proofs of the known theorems (or weaker versions) may be new. We use the phrase an elementary proof. This is not meant to be a technical or rigorous term. What we really mean is a proof that can be taught in an undergraduate combinatorics course. A good example of what we mean is the proof of Theorem 9.3.