Anti-Ramsey Numbers of Paths and Cycles in Hypergraphs
Anti-Ramsey Numbers of Paths and Cycles in Hypergraphs
The anti-Ramsey problem was introduced by Erdös, Simonovits, and Sós in 1970s. The anti-Ramsey number of a hypergraph H, ar(n,s, H), is the smallest integer c such that in any coloring of the edges of the s-uniform complete hypergraph on n vertices with exactly c colors, there is a copy …