Note on the anti-Ramsey number for matching in hypercubes

Abstract

Let Q be a host graph and $L\subseteq Q$ be a subgraph. The anti-Ramsey number $ar(Q,L)$ of L in Q, is defined as the largest number t that allows the existence of a t-edge-colored Q which contains no rainbow L. In this paper, the anti-Ramsey number for matchings when the host graph is hypercube is considered and some exact results are provided.