- Home
- Best Scientists - Mathematics
- Zoltán Füredi

Discipline name
D-index
D-index (Discipline H-index) only includes papers and citation values for an examined
discipline in contrast to General H-index which accounts for publications across all
disciplines.
Citations
Publications
World Ranking
National Ranking

Mathematics
D-index
50
Citations
8,522
254
World Ranking
798
National Ranking
398

Engineering and Technology
D-index
50
Citations
8,354
226
World Ranking
2054
National Ranking
794

- Combinatorics
- Geometry
- Discrete mathematics

The scientist’s investigation covers issues in Combinatorics, Discrete mathematics, Hypergraph, Conjecture and Upper and lower bounds. His research integrates issues of Function, Simple and Regular polygon in his study of Combinatorics. He has researched Discrete mathematics in several fields, including Matrix, Projective plane and Finite set.

His Finite set study combines topics from a wide range of disciplines, such as Disjoint sets, Algebra over a field and Existential quantification. His Conjecture course of study focuses on Intersection and Constant. His biological study spans a wide range of topics, including Mathematical proof, Ball, Exponential function, Cover and Besicovitch covering theorem.

- The eigenvalues of random symmetric matrices (613 citations)
- Families of finite sets in which no set is covered by the union ofr others (381 citations)
- The History of Degenerate (Bipartite) Extremal Graph Problems (173 citations)

His primary areas of study are Combinatorics, Discrete mathematics, Hypergraph, Graph and Conjecture. His study in Combinatorics is interdisciplinary in nature, drawing from both Upper and lower bounds and Regular polygon. His study ties his expertise on Projective plane together with the subject of Discrete mathematics.

His biological study deals with issues like Fano plane, which deal with fields such as Blocking set. His Hypergraph study incorporates themes from Vertex and Bounded function. His Graph study combines topics from a wide range of disciplines, such as Binary logarithm and Chromatic scale.

- Combinatorics (106.93%)
- Discrete mathematics (60.40%)
- Hypergraph (23.43%)

- Combinatorics (106.93%)
- Hypergraph (23.43%)
- Graph (20.46%)

His main research concerns Combinatorics, Hypergraph, Graph, Upper and lower bounds and Vertex. His Combinatorics research is multidisciplinary, incorporating perspectives in Discrete mathematics, Bounded function and Regular polygon. Zoltán Füredi has included themes like Structure, Extremal combinatorics, Convex function, Block and Family of sets in his Hypergraph study.

His Graph study combines topics in areas such as Injective function and Cartesian product. Graph and Triple system is closely connected to Degree in his research, which is encompassed under the umbrella topic of Upper and lower bounds. His studies deal with areas such as Path and Edge as well as Vertex.

- On 3-uniform hypergraphs without a cycle of a given length (36 citations)
- Avoiding long Berge cycles (17 citations)
- Stability in the Erdős–Gallai Theorem on cycles and paths, II (13 citations)

- Combinatorics
- Geometry
- Algebra

Combinatorics, Hypergraph, Discrete mathematics, Graph and Upper and lower bounds are his primary areas of study. Combinatorics is closely attributed to Bounded function in his study. His studies in Hypergraph integrate themes in fields like Extremal combinatorics and Structure.

His Erdős–Gallai theorem study, which is part of a larger body of work in Graph, is frequently linked to Stability theorem, bridging the gap between disciplines. His Upper and lower bounds research incorporates elements of Class and Order. The concepts of his Conjecture study are interwoven with issues in Vertex and Closed and exact differential forms.

This overview was generated by a machine learning system which analysed the scientist’s body of work. If you have any feedback, you can contact us here.

The eigenvalues of random symmetric matrices

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

Combinatorica **(1981)**

771 Citations

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

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

Israel Journal of Mathematics **(1985)**

597 Citations

The History of Degenerate (Bipartite) Extremal Graph Problems

Zoltán Füredi;Miklós Simonovits.

arXiv: Combinatorics **(2013)**

310 Citations

Computing the volume is difficult

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

Discrete and Computational Geometry **(1987)**

239 Citations

Matchings and covers in hypergraphs

Zoltán Füredi.

Graphs and Combinatorics **(1988)**

224 Citations

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.

Journal of Combinatorial Theory, Series A **(1982)**

183 Citations

New asymptotics for bipartite Tura´n numbers

Zoltán Füredi.

Journal of Combinatorial Theory, Series A **(1996)**

180 Citations

Onr-Cover-free Families

Zoltán Füredi.

Journal of Combinatorial Theory, Series A **(1996)**

163 Citations

Graphs without quadrilaterals

Zoltán Füredi.

Journal of Combinatorial Theory, Series B **(1983)**

158 Citations

Maximum degree and fractional matchings in uniform hypergraphs

Zoltán Füredi.

Combinatorica **(1981)**

149 Citations

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

Contact us

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:

University of Illinois at Urbana-Champaign

Alfréd Rényi Institute of Mathematics

Alfréd Rényi Institute of Mathematics

Tel Aviv University

University of Memphis

Alfréd Rényi Institute of Mathematics

Rutgers, The State University of New Jersey

Alfréd Rényi Institute of Mathematics

Hungarian Academy of Sciences

Free University of Bozen-Bolzano

University of Bath

TRUMPF Laser Gmbh

Monash University

KU Leuven

ETH Zurich

University of Sheffield

University of Edinburgh

Max Planck Society

University of California, Los Angeles

University of California, Davis

Trinity College Dublin

Agricultural Research Service

University of Birmingham

University of Bath

King's College London

Something went wrong. Please try again later.