Ara
Toplam kayıt 1, listelenen: 1-1
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 ...