45 citations · 106 across the 36 of their papers we have counts for
5 papers · 1 filter
Extremal numbers for odd cycles
Zoltan Füredi, David S. Gunderson
We describe the C_{2k+1}-free graphs on n vertices with maximum number of edges. The extremal graphs are unique except for n = 3k-1, 3k, 4k-2, or 4k-1. The value of ex(n,C_{2k+1})…
The history of degenerate (bipartite) extremal graph problems
Zoltán Füredi, Miklós Simonovits
This paper is a survey on Extremal Graph Theory, primarily focusing on the case when one of the excluded graphs is bipartite. On one hand we give an introduction to this field and…
Minimal symmetric differences of lines in projective planes
Paul Balister, Béla Bollobás, Zoltán Füredi +1
Let q be an odd prime power and let f(r) be the minimum size of the symmetric difference of r lines in the Desarguesian projective plane PG(2,q). We prove some results about the fu…
Minimal abundant packings and choosability with separation
Zoltan Furedi, Alexandr Kostochka, Mohit Kumbhat
A packing of size is a system of subsets (blocks) of a -element underlying set such that each block has elements and every -set is contained in at most…
Hypergraph Turan numbers of linear cycles
Zoltan Furedi, Tao Jiang
A k-uniform linear cycle of length s is a cyclic list of k-sets A_1,..., A_s such that consecutive sets intersect in exactly one element and nonconsecutive sets are disjoint. For a…