Letter to the editor (Q5903643)

In this letter the author collects results about the weak chromatic number of the hypergraph \(K^ p_ m\times K^ q_ n\), the direct product of two complete hypergraphs on m (resp. n) vertices with edges having cardinality p (resp. q). This is a special case of Erdős and Rado's ``Finite polarized partition relation'' and also a generalization of a problem by \textit{Gronau} and \textit{Labalm} entitled ``An extremal coloring problem on matrices'' [Discrete Math. 61, 321-324 (1986)]. In fact some of the results concerning this coloring problem were obtained earlier by the author.