Coloring of graphs associated to zero-divisors

Abstract: Let

G

be a graph,

c h i (G)

be the minimal number of colors which can be assigned to the vertices of

G

in such a way that every two adjacent vertices have different colors and

o m e g a (G)

to be the least upper bound of the size of the complete subgraphs contained in

G

. It is well-known that

c h i (G) g e q o m e g a (G)

. Beck in cite{b} conjectured that

c h i (G a m m a_{0} (R)) = o m e g a (G a m m a_{0} (R))

if

o m e g a (G a m m a_{0} (R)) < i n f t y

, where

G a m m a_{0} (R)

is a graph associated to a commutative ring

R

. In this note, we provide some sufficient conditions for a ring

R

to enjoy

c h i (G a m m a_{0} (R)) = o m e g a (G a m m a_{0} (R))

. As a consequence, we verify Beck's conjecture for the homomorphic image of

m a t h b b Z^{n}

.

This page was built for publication: Coloring of graphs associated to zero-divisors