… conjecture; we believe that an even stronger conjecture holds as well. Before we state this
conjecture, … However, we believe this slightly more general conjecture is not harder than the …

… 253–300, MR1161467 (93d:05072)], Füredi raised a conjecture about the … conjecture. In
particular, we show that for any Steiner triple system S on [k], there exist a family F of k-sets on [n…

… By an (n, S)-system we mean a hypergraph F on X, such that for every distinct pair E, F # F,
E{… phrase ``a hypergraph F on X'' in the above definition by ``a h-uniform hypergraph F on X''. …

… Füredi [5] verified Conjecture 1.1 when λ = 1. While this paper appears to be the first to consider
Conjecture 1.1 since [5], several special cases of Conjecture … ] showed Conjecture 1.1 is …

… We confirmed the following special case of Füredi’s conjecture … combines tensor product
methods and Füredi’s method, which … some natural conjectures which imply Füredi’s conjecture. …

… Following a conjecture of P. Erdos, we show that if 9 is a family of k-subsets … where dk is a
constant depending only on k. These results are special cases … Here we prove this conjecture. …

… of the generalized Füredi conjecture, we need a definition. … The generalized Füredi conjecture
holds for any Anderson–… provides further evidence for the generalized Füredi conjecture. …

… principal case, Conjecture 1.1 states that for m = t r the maximum Lagrangian is attained on
H m … While initially the Frankl–Füredi conjecture was motivated by applications to hypergraph …

… I) On the other hand let t be a minimal i-cover (1 s isq - 1). Then there exists a vertex x EV(A) …
From now on we suppose that IX,] 2 r - 1. Then (2.13) implies that there exists a vertex p E Xi …

Suppose that A is a finite set-system of N elements with the property |A ∩ A′| = 0, 1 or k for
any two different A, A′ ϵ A. We show that for N > k 14 |a|=⩽ N(N−1)(N−k) (k 2 −k+1)(k 2 −2k…