Anti-Ramsey problems for cycles

作者：

Highlights：

• We give a new method to compute the anti-Ramsey number by constructing a corresponding hypergraph.

• As application, we determine the exact values of Ar(G,Ck) when the host graph G is Wd, Pm×Pn, Pm×Cn, Cm×Cn and cyclic Cayley graph, respectively.

摘要

•We give a new method to compute the anti-Ramsey number by constructing a corresponding hypergraph.•As application, we determine the exact values of Ar(G,Ck) when the host graph G is Wd, Pm×Pn, Pm×Cn, Cm×Cn and cyclic Cayley graph, respectively.

论文关键词：Hypergraph,Rainbow,Anti-Ramsey problem,Cycle

论文评审过程：Received 17 January 2021, Revised 28 April 2021, Accepted 2 May 2021, Available online 26 May 2021, Version of Record 26 May 2021.

论文官网地址：https://doi.org/10.1016/j.amc.2021.126345