16 citations · 39 across the 10 of their papers we have counts for
14 papers
Shadows of 3-uniform hypergraphs under a minimum degree condition
Zoltán Füredi, Yi Zhao
We prove a minimum degree version of the Kruskal--Katona theorem: given and a triple system on vertices with minimum degree at least , we obtain asym…
Tight paths in convex geometric hypergraphs
Zoltán F\" uredi, Tao Jiang, Alexandr Kostochka +2
In this paper, we prove a theorem on tight paths in convex geometric hypergraphs, which is asymptotically sharp in infinitely many cases. Our geometric theorem is a common generali…
Nearly subadditive sequences
Zoltan Furedi, Imre Z. Ruzsa
We show that the de Bruijn-Erdős condition for the error term in their improvement of Fekete's Lemma is not only sufficient but also necessary in the following strong sense. Suppos…
Avoiding long Berge cycles II, exact bounds for all
Zoltan Furedi, Alexandr Kostochka, Ruth Luo
Let denote the maximum number of edges in an -vertex -uniform hypergraph with no Berge cycles of length or longer. In the first part of this work, we have fou…
Extremal problems on ordered and convex geometric hypergraphs
Zoltán Füredi, Tao Jiang, Alexandr Kostochka +2
An ordered hypergraph is a hypergraph whose vertex set is linearly ordered, and a convex geometric hypergraph is a hypergraph whose vertex set is cyclically ordered. Extremal probl…
Almost similar configurations
Imre Bárány, Zoltán Füredi
Let denote the maximum number of triangles with angles between and in any -element planar set. Our main result is an exact formula for . We al…