Abstract
Alon, Krech, and Szabó [SIAM J. Discrete Math., 21 (2007), pp. 66–72] called an edge-coloring of a hypercube with p colors such that every subcube of dimension d contains every color a d-polychromatic p-coloring. Denote by $p_d$ the maximum number of colors with which it is possible to d-polychromatically color any hypercube. We find the exact value of $p_d$ for all values of d.

This publication has 5 references indexed in Scilit: