World's Best Scientists 2026 revealed!

D-Index & Metrics

Mathematics

D-Index
58
Citations
10601
World Ranking
650
National Ranking
326

Engineering and Technology

D-Index
58
Citations
10406
World Ranking
2548
National Ranking
777

Overview

Zoltán Füredi is affiliated with the University of Illinois at Urbana-Champaign in the United States. Their research primarily spans the fields of Mathematics and Computer Science, with a strong concentration in Discrete Mathematics and Combinatorics, Computational Theory and Mathematics, Geometry and Topology, Electrical and Electronic Engineering, and Applied Mathematics.

Their scholarly output has focused extensively on topics including Limits and Structures in Graph Theory, Advanced Graph Theory Research, graph theory and CDMA systems, Graph theory and applications, Analytic Number Theory Research, Graph Labeling and Dimension Problems, and Finite Group Theory Research.

Key recent papers authored or co-authored by Zoltán Füredi include:

  • "Tight paths in convex geometric hypergraphs," 2020, Advances in Combinatorics
  • "An Extension of Mantel's Theorem to k-Graphs," 2020, American Mathematical Monthly
  • "An Upper Bound on the Size of Sidon Sets," 2023, American Mathematical Monthly
  • "Extremal problems for convex geometric hypergraphs and ordered hypergraphs," 2020, Canadian Journal of Mathematics
  • "Berge Cycles in Non-Uniform Hypergraphs," 2020, The Electronic Journal of Combinatorics

The frequent collaborators in Füredi's research include Alexandr Kostochka, Ruth Luo, Dhruv Mubayi, Jacques Verstraëte, and Tao Jiang.

The scientist has published extensively in several notable academic venues, with the most frequent outlets including arXiv (Cornell University), The Electronic Journal of Combinatorics, American Mathematical Monthly, SIAM Journal on Discrete Mathematics, and the Journal of Combinatorial Theory Series A.

Best Publications

  • The eigenvalues of random symmetric matrices

    Zoltán Füredi;János Komlós

  • Families of finite sets in which no set is covered by the union ofr others

    P. Erdös;P. Frankl;Z. Füredi

  • The History of Degenerate (Bipartite) Extremal Graph Problems

    Zoltán Füredi;Miklós Simonovits

  • Computing the volume is difficult

    Imre Bárány;Zoltán Füredi

  • Matchings and covers in hypergraphs

    Zoltán Füredi

  • Families of finite sets in which no set is covered by the union of two others

    Paul Erdös;Peter Frankl;Zoltán Füredi

  • New asymptotics for bipartite Tura´n numbers

    Zoltán Füredi

  • Onr-Cover-free Families

    Zoltán Füredi

  • Graphs without quadrilaterals

    Zoltán Füredi

  • Maximum degree and fractional matchings in uniform hypergraphs

    Zoltán Füredi

  • An Upper Bound on Zarankiewicz' Problem

    Zoltán Füredi

  • Point Selections and Weak ε-Nets for Convex Hulls

    Noga Alon;Noga Alon;Imre Bárány;Imre Bárány;Zoltán Füredi;Daniel J. Kleitman

  • Forbidding just one intersection

    Peter Frankl;Zoltán Füredi

  • On the number of halving planes

    Imre Bárány;Zoltán Füredi;László Lovász;László Lovász

  • The number of maximal independent sets in connected graphs

    Zoltán Füredi

  • A new generalization of the Erdős-Ko-Rado theorem

    Peter Frankl;Zoltán Füredi

  • Shadows of colored complexes.

    P. Frankl;Zoltan Füredi;Gil Kalai

  • Exact solution of some Tura´n-type problems

    P. Frankl;Z. Füredi

  • Triple Systems Not Containing a Fano Configuration

    Zoltán Füredi;Miklós Simonovits

  • The maximum number of unit distances in a convex n -gon

    Zoltån Füredi

  • Computing the volume is difficult

    Z Furedi;I Barany

Frequent Co-Authors

Alexandr V. Kostochka
Alexandr V. Kostochka University of Illinois at Urbana-Champaign
Peter Frankl
Peter Frankl Alfréd Rényi Institute of Mathematics
Dhruv Mubayi
Dhruv Mubayi University of Illinois at Chicago
Imre Bárány
Imre Bárány Alfréd Rényi Institute of Mathematics
Noga Alon
Noga Alon Tel Aviv University
Béla Bollobás
Béla Bollobás University of Memphis
András Gyárfás
András Gyárfás Alfréd Rényi Institute of Mathematics
Endre Boros
Endre Boros Rutgers, The State University of New Jersey
Miklós Simonovits
Miklós Simonovits Alfréd Rényi Institute of Mathematics

If you think any of the details on this page are incorrect, let us know.

Report an issue

We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below:

Related Online Degrees & Career Pathways

For students pursuing Mathematics in the USA, exploring related online degrees can open diverse career opportunities. Many professionals complement their math background with an MBA to develop leadership and business skills. Programs like the shortest online MBA programs offer accelerated paths, allowing you to gain essential business knowledge quickly while continuing your math studies.

Alternatively, combining math with a focused field such as marketing enhances analytical and strategic capabilities. Look into an online marketing degree to access affordable programs that deliver strong ROI in terms of post-graduation salaries and growth potential.

Many students prefer concentrated study periods, making year long MBA programs a popular choice. These programs fit well with the fast pace of the tech and finance sectors, which often recruit math graduates for analytic and managerial roles.

When considering transferring credits from prior coursework to maximize efficiency, explore online MBA transfer credits policies. This can significantly shorten your study timeline, saving time and tuition fees while leveraging your academic achievements.

Best Scientists Citing Zoltán Füredi

Trending Scientists

Recently Published Articles