Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
9512470 | Discrete Mathematics | 2005 | 8 Pages |
Abstract
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.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
James H. Schmerl,