 Hedetniemi's conjecture is then equivalent to saying that .The Weak Hedetniemi Conjecture instead states merely that the function "f"("n") is unbounded.In other words, if the tensor product of two graphs can be colored with few colors, this should imply some bound on the chromatic number of one of the factors.