arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1607.00420math.CO
收藏

半群的幂图的着色

Coloring the power graph of a semigroup

Yaroslav Shitov

摘要:

设$G$是半群.幂图$\mathcal{P}(G)$的顶点是$G$的元素,并且两个元素相邻当且仅当其中一个是另一个的幂。我们证明了$\mathcal{P}(G)$的色数至多是可数的,从而回答了最近的一个问题。

英文摘要:

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.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑