Now showing items 1-1 of 1
Anti-Ramsey Number Of Matchings In Hypergraphs
(Elsevier Science Bv, 2013)
A k-matching in a hypergraph is a set of k edges such that no two of these edges intersect. The anti-Ramsey number of a k-matching in a complete s-uniform hypergraph H on n vertices, denoted by ar(n, s, k), is the smallest ...