Now showing items 1-2 of 2
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 ...
On 3-Uniform Hypergraphs Without A Cycle Of A Given Length
(Elsevier Science Bv, 2017)
We study the maximum number of hyperedges in a 3-uniform hypergraph on n vertices that does not contain a Berge cycle of a given length l. In particular we prove that the upper bound for C2k+1-free hypergraphs is of the ...