Ara
Toplam kayıt 3, listelenen: 1-3
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 The Ratio Of Maximum And Minimum Degree In Maximal Intersecting Families
(Elsevier Science Bv, 2013)
To study how balanced or unbalanced a maximal intersecting family F subset of ((vertical bar n vertical bar) (r)) is we consider the ratio R(F) = Delta(F)/delta(F) of its maximum and minimum degree. We determine the order ...
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 ...