Coloring the power graph of a semigroup

Abstract

Let $G$ be a semigroup. The vertices of the power graph $\mathcal{P}(G)$ are the elements of $G$, and two elements are adjacent if and only if one of them is a power of the other. We show that the chromatic number of $\mathcal{P}(G)$ is at most countable, answering a recent question of Aalipour et al.

note, 4 pages