Add to ORKGDedicated to Ron Graham on the occasion of his 80th birthday Abstract. We investigate extremal problems for hypergraphs satisfying the following den-sity condition. A 3-uniform hypergraph H “ pV,Eq is pd, η, q-dense if for any two subsets of pairs P, Q Ď V ˆ V the number of pairs ppx, yq, px, zqq P P ˆ Q with tx, y, zu P E is at least d |K pP,Qq | ´ η |V |3, where K pP,Qq denotes the set of pairs in P ˆQ of the form ppx, yq, px, zqq. For a given 3-uniform hypergraph F we are interested in the infimum d ě 0 such that for sufficiently small η every sufficiently large pd, η, q-dense hypergraph H con-tains a copy of F and this infimum will be denoted by pi pF q. We present a few results for the case when F “ Kp3qk is a complete three uniform h...
AbstractIn this paper we find, for n≤16, the maximum number of edges in a 4-uniform hypergraph which...
Let F 3,2 denote the 3-graph ade, bde, cde}. We show that the maximum size of an F 3,2 -free 3-gra...
It is known that the 3-uniform loose 3-cycle decomposes the complete 3-uniform hypergraph of order v...
Abstract. Extremal problems for 3-uniform hypergraphs are known to be very difficult and despite con...
ABSTRACT: Let 0 be any fixed 3-uniform hypergraph. For a 3-uniform hypergraph we define 0() to be t...
A k-uniform semi-algebraic hypergraph H is a pair (P,E), where P is a subset of Rd and E is a collec...
Abstract. In 1965 Erdős conjectured that the number of edges in k-uniform hypergraphs on n vertices...
The problem of determining extremal hypergraphs containing at most r isomorphic copies of some eleme...
Let Bi(k) be the k-uniform hypergraph whose vertex set is of the form S U T, where |S| = i, |T| = k ...
<p>Let $B_i^{(k)}$ be the $k$-uniform hypergraph whose vertex set is of the form $S\cup T$, where $|...
AbstractWe consider extremal problems ‘of Turán type’ for r-uniform ordered hypergraphs, where multi...
AbstractWe consider a new type of extremal hypergraph problem: given an r-graph F and an integer k≥2...
AbstractFix l⩾r⩾2. Let Hl+1(r) be the r-uniform hypergraph obtained from the complete graph Kl+1 by ...
AbstractWe consider conditions which allow the embedding of linear hypergraphs of fixed size. In par...
In this paper we consider spectral extremal problems for hypergraphs. We give two general criteria u...
AbstractIn this paper we find, for n≤16, the maximum number of edges in a 4-uniform hypergraph which...
Let F 3,2 denote the 3-graph ade, bde, cde}. We show that the maximum size of an F 3,2 -free 3-gra...
It is known that the 3-uniform loose 3-cycle decomposes the complete 3-uniform hypergraph of order v...
Abstract. Extremal problems for 3-uniform hypergraphs are known to be very difficult and despite con...
ABSTRACT: Let 0 be any fixed 3-uniform hypergraph. For a 3-uniform hypergraph we define 0() to be t...
A k-uniform semi-algebraic hypergraph H is a pair (P,E), where P is a subset of Rd and E is a collec...
Abstract. In 1965 Erdős conjectured that the number of edges in k-uniform hypergraphs on n vertices...
The problem of determining extremal hypergraphs containing at most r isomorphic copies of some eleme...
Let Bi(k) be the k-uniform hypergraph whose vertex set is of the form S U T, where |S| = i, |T| = k ...
<p>Let $B_i^{(k)}$ be the $k$-uniform hypergraph whose vertex set is of the form $S\cup T$, where $|...
AbstractWe consider extremal problems ‘of Turán type’ for r-uniform ordered hypergraphs, where multi...
AbstractWe consider a new type of extremal hypergraph problem: given an r-graph F and an integer k≥2...
AbstractFix l⩾r⩾2. Let Hl+1(r) be the r-uniform hypergraph obtained from the complete graph Kl+1 by ...
AbstractWe consider conditions which allow the embedding of linear hypergraphs of fixed size. In par...
In this paper we consider spectral extremal problems for hypergraphs. We give two general criteria u...
AbstractIn this paper we find, for n≤16, the maximum number of edges in a 4-uniform hypergraph which...
Let F 3,2 denote the 3-graph ade, bde, cde}. We show that the maximum size of an F 3,2 -free 3-gra...
It is known that the 3-uniform loose 3-cycle decomposes the complete 3-uniform hypergraph of order v...