Anti-Ramsey Numbers in Complete k-Partite Graphs

Jili Ding, Hong Bian and Haizheng Yu

Mathematical Problems in Engineering, 2020, vol. 2020, 1-5

Abstract:

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.

Date: 2020
References: Add references at CitEc
Citations:

Downloads: (external link)
http://downloads.hindawi.com/journals/MPE/2020/5136104.pdf (application/pdf)
http://downloads.hindawi.com/journals/MPE/2020/5136104.xml (text/xml)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:hin:jnlmpe:5136104

DOI: 10.1155/2020/5136104

Access Statistics for this article

More articles in Mathematical Problems in Engineering from Hindawi
Bibliographic data for series maintained by Mohamed Abdelhakeem ().