For an
‐graph
, the anti‐Ramsey number
is the minimum number
of colors such that for any edge‐coloring of the complete
‐graph on
vertices with at least
colors, there is a copy of
whose edges have distinct colors. Let
and
be the path and cycle with
edges in 2‐graphs, respectively. In this paper,...