Anti-Ramsey numbers of loose paths and cycles in uniform hypergraphs

Tong Li, Yucong Tang, Guanghui Wang +1

For a fixed family of $r$-uniform hypergraphs $\mathcal{F}$, the anti-Ramsey number of $\mathcal{F}$, denoted by $ar(n,r,\mathcal{F})$, is the minimum number $c$ of colors such th…