On digraph-different permutations

We extend several results on graph-different permutations of the third author and C. Malvenuto to the case of directed graphs and introduce several new open problems. This problem area is the natural extension of Sperner capacity of directed graphs to the case of infinite graphs. Sperner capacity is the key tool in determining the zero-error capacity of compound channels in case of uninformed encoder and decoder.