World's Best Scientists 2026 revealed!
Award Badge
Mathematics
Hungary
2026

D-Index & Metrics

Mathematics

D-Index
104
Citations
58532
World Ranking
37
National Ranking
2

Research.com Recognitions

  • 2026 - Research.com Mathematics in Hungary Leader Award
  • 2025 - Research.com Mathematics in Hungary Leader Award
  • 2023 - Research.com Mathematics in Hungary Leader Award
  • 2013 - Fellow of the American Mathematical Society
  • 2012 - Member of the National Academy of Sciences
  • 2010 - Kyoto Prize in Mathematical sciences Outstanding Contributions to Mathematical Sciences Based on Discrete Optimization Algorithms
  • 2006 - Royal Netherlands Academy of Arts and Sciences
  • 2006 - INFORMS John von Neumann Theory Prize
  • 2002 - German National Academy of Sciences Leopoldina - Deutsche Akademie der Naturforscher Leopoldina – Nationale Akademie der Wissenschaften Mathematics
  • 1999 - Wolf Prize in Mathematics for his outstanding contributions to combinatorics, theoretical computer science and combinatorial optimization.
  • 1993 - Brouwer Medal
  • 1991 - Member of Academia Europaea
  • 1979 - George Pólya Prize

Overview

László Lovász is affiliated with Eötvös Loránd University in Hungary. Their research work primarily spans the fields of Mathematics and Computer Science, with a strong focus on Computational Theory and Mathematics as well as Discrete Mathematics and Combinatorics. Additional subfields of interest include Geometry and Topology, Statistical and Nonlinear Physics, and Mathematical Physics.

The scientist's main areas of study revolve around topics such as Limits and Structures in Graph Theory, Advanced Graph Theory Research, Graph theory and applications, Complex Network Analysis Techniques, Advanced Topology and Set Theory, Stochastic processes and statistical mechanics, and Advanced Algebra and Logic.

Among their recent publications are:

  • Impact of physicality on network structure (2023) in Nature Physics
  • Multigraph limits, unbounded kernels, and Banach space decorated graphs (2021) in Journal of Functional Analysis
  • Switchover phenomenon induced by epidemic seeding on geometric networks (2021) in Proceedings of the National Academy of Sciences
  • Elusive extremal graphs (2020) in Proceedings of the London Mathematical Society
  • Cycles of a given length in tournaments (2022) in Journal of Combinatorial Theory Series B

László Lovász frequently publishes in a range of academic venues, including the following:

  • arXiv (Cornell University)
  • Journal of Combinatorial Theory Series B
  • Journal of Graph Theory
  • Proceedings of the National Academy of Sciences
  • Acta Mathematica Academiae Scientiarum Hungaricae

Collaborations form an important aspect of their scholarly activities. Some of the frequent co-authors are:

  • Balázs Szegedy
  • Dávid Kunszenti-Kovács
  • Márton Pósfai
  • Miklós Abért
  • János Kertész

A number of awards and honors have been conferred on László Lovász over their career, including the Fellowship of the American Mathematical Society in 2013, membership in the National Academy of Sciences in 2012, and the Kyoto Prize in Mathematical sciences in 2010 for contributions to mathematical sciences based on discrete optimization algorithms.

Additional distinctions include the INFORMS John von Neumann Theory Prize and membership in the Royal Netherlands Academy of Arts and Sciences in 2006, election to the German National Academy of Sciences Leopoldina in 2002 with a focus on Mathematics, the Wolf Prize in Mathematics in 1999 for work in combinatorics, theoretical computer science, and combinatorial optimization, the Brouwer Medal in 1993, membership of Academia Europaea in 1991, and the George Pólya Prize in 1979.

Best Publications

  • Factoring Polynomials with Rational Coefficients

    Arjen K. Lenstra;H. W. Lenstra;L. Lovasz

  • Geometric Algorithms and Combinatorial Optimization

    Martin Grötschel;László Lovász;Alexander Schrijver

  • The ellipsoid method and its consequences in combinatorial optimization

    Martin Grötschel;Lászlo Lovász;Alexander Schrijver

  • Random Walks on Graphs: A Survey

    L. Lovász

  • Combinatorial problems and exercises

    László Lovász

  • On the Shannon capacity of a graph

    L. Lovasz

  • Large Networks and Graph Limits

    László Lovász

  • On the ratio of optimal integral and fractional covers

    L. Lovász

  • Submodular functions and convexity

    L. Lovász

  • Cones of Matrices and Set-Functions and 0–1 Optimization

    László Lovász;Alexander Schrijver

  • Kneser's conjecture, chromatic number, and homotopy

    László Lovász

  • Normal hypergraphs and the perfect graph conjecture

    L. Lovász

  • Limits of dense graph sequences

    László Lovász;Balázs Szegedy

  • Handbook of Combinatorics

    Ronald L. Graham;Martin Grötschel;László Lovász

  • Random walks, universal traversal sequences, and the complexity of maze problems

    Romas Aleliunas;Richard M. Karp;Richard J. Lipton;Laszlo Lovasz

  • Convergent sequences of dense graphs I: Subgraph frequencies, metric properties and testing

    C. Borgs;Jennifer T. Chayes;László Lovász;Vera T. Sós

  • Random walks in a convex body and an improved volume algorithm

    László Lovász;Miklós Simonovits

  • Approximating clique is almost NP-complete

    U. Feige;S. Goldwasser;L. Lovasz;S. Safra

  • Interactive proofs and the hardness of approximating cliques

    Uriel Feige;Shafi Goldwasser;Laszlo Lovász;Shmuel Safra

  • A Characterization of Perfect Graphs

    L LovÁsz

Frequent Co-Authors

Alexander Schrijver
Alexander Schrijver University of Amsterdam
Jacob Fox
Jacob Fox Stanford University
Jennifer Chayes
Jennifer Chayes University of California, Berkeley
Santosh Vempala
Santosh Vempala Georgia Institute of Technology
Christian Borgs
Christian Borgs University of California, Berkeley
Miklós Simonovits
Miklós Simonovits Alfréd Rényi Institute of Mathematics
Ravi Kannan
Ravi Kannan Microsoft (United States)
Ron Graham
Ron Graham University of California, San Diego
Michael Saks
Michael Saks Rutgers, The State University of New Jersey
Peter Winkler
Peter Winkler Dartmouth College

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

Studying Mathematics in the USA opens doors to a variety of interdisciplinary fields and advanced degree options. For those interested in leveraging data skills alongside mathematical theory, pursuing an ms in data analytics is an excellent way to enhance employability in sectors like finance, healthcare, and technology.

Mathematics graduates who wish to combine quantitative expertise with business acumen may consider an MBA. Many explore the easiest mba program to get into as a practical pathway to quickly boost leadership credentials without compromising quality.

For working professionals seeking flexibility, the easiest and fastest online mba programs offer a convenient route to advance managerial skills while continuing career progression in parallel.

Furthermore, those looking to reach the highest-level expertise in business administration with an emphasis on research might explore dba programs. These degrees combine analytical thinking with leadership, making them valuable for mathematical professionals eyeing academic or executive roles.

Best Scientists Citing László Lovász

Trending Scientists