Title of article
Generic automorphisms and graph coloring Original Research Article
Author/Authors
James H. Schmerl، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2005
Pages
8
From page
235
To page
242
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.
Keywords
Generic automorphisms , Recursively saturated , Peano Arithmetic , Hedetniemiיs conjecture
Journal title
Discrete Mathematics
Serial Year
2005
Journal title
Discrete Mathematics
Record number
948541
Link To Document