Chromatic Numbers of Products of Tournaments: FractionalAspects of Hedetniemi's Conjecture.

The chromatic number of the categorical product of two n-tournaments can be strictly smaller than n. We show that min{ (S ◊ T) : S and T are n-tournaments} is asymptotically equal to n , where 1 2 .