The eigenvalues of random symmetric matrices Z Füredi, J Komlós Combinatorica 1 (3), 233-241, 1981 | 720 | 1981 |

Families of finite sets in which no set is covered by the union of*r* othersP Erdös, P Frankl, Z Füredi Israel Journal of Mathematics 51 (1-2), 79-89, 1985 | 543* | 1985 |

Computing the volume is difficult I Bárány, Z Füredi Discrete & Computational Geometry 2 (4), 319-326, 1987 | 222 | 1987 |

The history of degenerate (bipartite) extremal graph problems Z Füredi, M Simonovits Erdős Centennial, 169-264, 2013 | 207 | 2013 |

Matchings and covers in hypergraphs Z Füredi Graphs and Combinatorics 4 (1), 115-206, 1988 | 207 | 1988 |

Davenport-Schinzel theory of matrices Z Füredi, P Hajnal Discrete Mathematics 103 (3), 233-251, 1992 | 160 | 1992 |

Turán type problems Z Füredi Surveys in combinatorics 166, 253-300, 1991 | 160 | 1991 |

New asymptotics for bipartite Turán numbers Z Füredi Journal of Combinatorial Theory, Series A 75 (1), 141-144, 1996 | 156 | 1996 |

Onr-cover-free families Z Füredi Journal of Combinatorial Theory, Series A 73 (1), 172-173, 1996 | 153 | 1996 |

Maximum degree and fractional matchings in uniform hypergraphs Z Füredi Combinatorica 1 (2), 155-162, 1981 | 139 | 1981 |

Point selections and weak ε-nets for convex hulls N Alon, I Bárány, Z Füredi, DJ Kleitman Combinatorics, Probability and Computing 1 (3), 189-200, 1992 | 137 | 1992 |

On the number of halving planes I Bárány, Z Füredi, L Lovász Combinatorica 10 (2), 175-183, 1990 | 124 | 1990 |

An upper bound on Zarankiewicz'problem Z Füredi Combinatorics, Probability and Computing 5 (1), 29-33, 1996 | 117 | 1996 |

The maximum number of unit distances in a convex n-gon. Z Füredi J. Comb. Theory, Ser. A 55 (2), 316-320, 1990 | 108 | 1990 |

The number of maximal independent sets in connected graphs Z Füredi Journal of Graph Theory 11 (4), 463-470, 1987 | 108 | 1987 |

Exact solution of some Turán-type problems P Frankl, Z Füredi Journal of Combinatorial Theory, Series A 45 (2), 226-262, 1987 | 99 | 1987 |

Triple systems not containing a Fano configuration Z Furedi, M Simonovits Combinatorics Probability and Computing 14 (4), 467-484, 2005 | 98 | 2005 |

The number of triangles covering the center of an *n*-setE Boros, Z Füredi Geometriae Dedicata 17 (1), 69-77, 1984 | 96 | 1984 |

Extremal problems whose solutions are the blowups of the small Witt-designs P Frankl, Z Füredi Journal of Combinatorial Theory, Series A 52 (1), 129-147, 1989 | 93 | 1989 |

On the number of edges of quadrilateral-free graphs Z Füredi Journal of Combinatorial Theory, Series B 68 (1), 1-6, 1996 | 92 | 1996 |