4 citations · 5 across the 4 of their papers we have counts for
4 papers
The linear Turán number of the k-fan
Zoltán Füredi, András Gyárfás
A hypergraph is linear if any two edges intersect in at most one vertex. For a fixed -uniform family of hypergraphs, the linear Turán number ${\rm ex}_{\rm lin}(n,{\…
Turán numbers of hypergraph trees
Zoltán Füredi, Tao Jiang
An -graph is an -uniform hypergraph tree (or -tree) if its edges can be ordered as such that such that $E_i\cap (\bigcup_…
2-cancellative hypergraphs and codes
Zoltán Füredi
A family of sets F (and the corresponding family of 0-1 vectors) is called t-cancellative if for all distict t+2 members A_1,... A_t and B,C from F the union of A_1,..., A_t and B…
Uniform hypergraphs containing no grids
Zoltán Füredi, Miklós Ruszinkó
A hypergraph is called an r by r grid if it is isomorphic to a pattern of r horizontal and r vertical lines. Three sets form a triangle if they pairwise intersect in three distinct…