Strong isometric dimension, biclique coverings, and sperner's theorem

The strong isometric dimension of a graph G is the least number k such that G isometrically embeds into the strong product of k paths. Using Sperner's theorem, the strong isometric dimension of the Hamming graphs K-2 square K-n is determined