论文信息 - Generic automorphisms and graph coloring - 字舞流文

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.

James H. Schmerl

[1] James H. Schmerl,et al. The Automorphism Group of an Arithmetically Saturated Model of Peano Arithmetic , 1995 .

[2] Svatopluk Poljak. Coloring digraphs by iterated antichains , 1991 .

[3] John K. Truss,et al. Generic Automorphisms of Homogeneous Structures , 1992 .

[4] Svatopluk Poljak,et al. On the arc-chromatic number of a digraph , 1981, J. Comb. Theory, Ser. B.

[5] Richard Kaye,et al. Automorphisms of first-order structures , 1994 .

[6] Tommy R. Jensen,et al. Graph Coloring Problems , 1994 .

[7] John K. Truss,et al. Generic automorphisms of the universal partial order , 2000 .

[8] Norbert Sauer,et al. The chromatic number of the product of two 4-chromatic graphs is 4 , 1985, Comb..

[9] András Hajnal. The chromatic number of the product of two ℵ1-chromatic graphs can be countable , 1985 .