László Lovász (Hungarian: [ˈlovaːs ˈlaːsloː]; born March 9, 1948) is a Hungarian mathematician and professor emeritus at Eötvös Loránd University, best known for his work in combinatorics, for which he was awarded the 2021 Abel Prize jointly with Avi Wigderson.

[3] Paul Erdős helped introduce Lovász to graph theory at a young age.

[1] He then returned to Eötvös Loránd University as a professor and the Chair of Computer Science until 1993.

[1] He returned to Eötvös Loránd University where he was the director of the Mathematical Institute (2006–2011)[9] and a professor in the Department of Computer Science (2006–2018).

[3] This included the Lovász local lemma, which has become a standard technique for proving the existence of rare graphs.

[1][15][16] In March 2021, he shared the Abel Prize with Avi Wigderson from the Institute for Advanced Study "for their foundational contributions to theoretical computer science and discrete mathematics, and their leading role in shaping them into central fields of modern mathematics".

[22] Lovász is married to fellow mathematician Katalin Vesztergombi,[23] with whom he participated in a program for high school students gifted in mathematics,[24] and has four children.