Add to ORKGIn this paper, we study r-uniform hypergraphs H without cycles of length less than five, employing the definition of a hypergraph cycle due to Berge. In particular, for r = 3, we show that if H has n vertices and a maximum number of edges, then |H | = 1 6 n3/2 + o(n3/2). This also asymptotically determines the generalized Turán number T3(n, 8, 4). Some results are based on our bounds for the maximum size of Sidon-type sets in Zn.
AbstractUsing the definition of cycles in hypergraphs due to Berge, we show that a hypergraph H cont...
AbstractFix l⩾r⩾2. Let Hl+1(r) be the r-uniform hypergraph obtained from the complete graph Kl+1 by ...
Let n≥k≥r+3 and H be an n-vertex r-uniform hypergraph. We show that if |H|>[Formula presented](k−1r)...
In this paper, we study r-uniform hypergraphs H without cycles of length less than ve, employing the...
We give lower bounds on the maximum possible girth of an r-uniform, d-regular hypergraph with at mos...
Let fr(n) be the maximum number of edges in an r-uniform hypergraph on n vertices that does not cont...
AbstractLet fr(n) be the maximum number of edges in an r-uniform hypergraph on n vertices that does ...
We give lower bounds on the maximum possible girth of an r-uniform, d-regular hypergraph with at mos...
Let fr(n) be the maximum number of edges in an r-uniform hypergraph on n vertices that does not cont...
We study the maximum number of hyperedges in a 3-uniform hypergraph on n vertices that does not cont...
Let t r (n; r + 1) denote the smallest integer m such that every r-uniform hypergraph on n vertices ...
AbstractLet tr(n, r+1) denote the smallest integer m such that every r-uniform hypergraph on n verti...
The following very natural problem was raised by Chung and Erdős in the early 80’s and has since bee...
More than forty years ago, Erdős conjectured that for any , every k-uniform hypergraph on n vertices...
One of the earliest results in Extremal Combinatorics is Mantel's theorem from 1907 which says that ...
AbstractUsing the definition of cycles in hypergraphs due to Berge, we show that a hypergraph H cont...
AbstractFix l⩾r⩾2. Let Hl+1(r) be the r-uniform hypergraph obtained from the complete graph Kl+1 by ...
Let n≥k≥r+3 and H be an n-vertex r-uniform hypergraph. We show that if |H|>[Formula presented](k−1r)...
In this paper, we study r-uniform hypergraphs H without cycles of length less than ve, employing the...
We give lower bounds on the maximum possible girth of an r-uniform, d-regular hypergraph with at mos...
Let fr(n) be the maximum number of edges in an r-uniform hypergraph on n vertices that does not cont...
AbstractLet fr(n) be the maximum number of edges in an r-uniform hypergraph on n vertices that does ...
We give lower bounds on the maximum possible girth of an r-uniform, d-regular hypergraph with at mos...
Let fr(n) be the maximum number of edges in an r-uniform hypergraph on n vertices that does not cont...
We study the maximum number of hyperedges in a 3-uniform hypergraph on n vertices that does not cont...
Let t r (n; r + 1) denote the smallest integer m such that every r-uniform hypergraph on n vertices ...
AbstractLet tr(n, r+1) denote the smallest integer m such that every r-uniform hypergraph on n verti...
The following very natural problem was raised by Chung and Erdős in the early 80’s and has since bee...
More than forty years ago, Erdős conjectured that for any , every k-uniform hypergraph on n vertices...
One of the earliest results in Extremal Combinatorics is Mantel's theorem from 1907 which says that ...
AbstractUsing the definition of cycles in hypergraphs due to Berge, we show that a hypergraph H cont...
AbstractFix l⩾r⩾2. Let Hl+1(r) be the r-uniform hypergraph obtained from the complete graph Kl+1 by ...
Let n≥k≥r+3 and H be an n-vertex r-uniform hypergraph. We show that if |H|>[Formula presented](k−1r)...