当前位置: X-MOL 学术Math. Probl. Eng. › 论文详情
Our official English website, www.x-mol.net, welcomes your feedback! (Note: you will need to create a separate account there.)
Anti-Ramsey Numbers in Complete k-Partite Graphs
Mathematical Problems in Engineering Pub Date : 2020-09-07 , DOI: 10.1155/2020/5136104
Jili Ding 1 , Hong Bian 1 , Haizheng Yu 2
Affiliation  

The anti-Ramsey number is the maximum number of colors in an edge-coloring of such that contains no rainbow subgraphs isomorphic to . In this paper, we discuss the anti-Ramsey numbers , , and of , where denote the family of all spanning trees, the family of all perfect matchings, and the family of all Hamilton cycles in , respectively.

中文翻译:

完整的k-Partite图中的反Ramsey数

反拉姆齐数 是的边缘着色的最大颜色数其中不包含与相同的彩虹子图在本文中,我们讨论了反拉姆齐数 其中表示所有生成树的家庭,所有完美匹配的家庭,并在所有哈密顿回路的家庭分别。
更新日期:2020-09-08
down
wechat
bug