Generic automorphisms and graph coloring

The question of whether or not a given countable arithmetically saturated model of Peano Arithmetic has a generic automorphism is shown to be very closely connected to Hedetniemi's well-known conjecture on the chromatic number of products of graphs.