Anti-Ramsey numbers of paths and cycles in hypergraphs

Ran Gu, Jiaao Li, Yongtang Shi

The anti-Ramsey problem was introduced by Erdős, Simonovits and Sós in 1970s. The anti-Ramsey number of a hypergraph $\mathcal{H}$, $ar(n,s,\mathcal{H})$, is the smallest integer…