Coloring digraphs by iterated antichains
We show that the minimum chromatic number of a product of two -chromatic graphs is either bounded by 9, or tends to infinity. The result is obtained by the study of coloring iterated adjoints of a digraph by iterated antichains of a poset.