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

全对称有色图

All totally symmetric colored graphs

Mariusz Grech, Andrzej Kisielewicz

摘要:

在本文中,我们描述了所有的边-有色图,这是完全对称的颜色和传递的每一组边的相同颜色。它们对应于完全图的完全对称齐次因子分解。我们的描述完成了我们在前一篇论文中所做的工作,在那里我们已经证明,特别是,没有这样的图超过5种颜色。利用最近的一些结果,在计算机的帮助下,我们解决了所有的情况下,在以前的文件中是开放的。

英文摘要:

In this paper we describe all edge-colored graphs that are fully symmetric with respect to colors and transitive on every set of edges of the same color. They correspond to fully symmetric homogeneous factorizations of complete graphs. Our description completes the work done in our previous paper, where we have shown, in particular, that there are no such graphs with more than 5 colors. Using some recent results, with a help of computer, we settle all the cases that was left open in the previous paper.

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

↑