Mathematics Atlas

How Proof Is Made
Sign In
Text size
100%
Theme
Mathematician

László Lovász

Modern

László Lovász, born on March 9, 1948 in Budapest, 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. He won three gold medals and one silver medal at the International Mathematical Olympiad in the 1960s, and Paul Erdős helped introduce him to graph theory at a young age. In graph theory his notable contributions include the proofs of Kneser's conjecture and the Lovász local lemma and the formulation of the Erdős-Faber-Lovász conjecture, and he is one of the authors of the LLL lattice reduction algorithm. He was president of the International Mathematical Union from 2007 to 2010 and of the Hungarian Academy of Sciences from 2014 to 2020.

Facts
Biography
Gender
Male 1
Connections

Attributed Works

Source Lovász Number (Wikipedia)

Conjectures Posed

Source Lovász conjecture (Wikipedia)

In Branch

Source Wikipedia: László Lovász

Proofs Credited

Source Lovasz local lemma (Wikipedia)
In the Other Atlases

Same As

Also in Computing Atlas: the same subject.

Nationality

Also in Geography Atlas: the nationality of this subject.

Sources
1. Wikipedia: László Lovász
Lead
Quote, Lead
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.
View the Source
Lovász Number (Wikipedia)
Attributed Works: Lovász Number, Lead sentence, attribution
Quote, Attributed Works: Lovász Number, Lead sentence, attribution
first introduced by László Lovász
View the Source
Lovasz local lemma (Wikipedia)
Proofs Credited: Lovasz Local Lemma, Lead
Quote, Proofs Credited: Lovasz Local Lemma, Lead
A weaker version was proved in 1975 by László Lovász and Paul Erdős in the article Problems and results on 3-chromatic hypergraphs and some related questions.
View the Source
Lovász conjecture (Wikipedia)
Conjectures Posed: Lovasz Conjecture, Lead
Quote, Conjectures Posed: Lovasz Conjecture, Lead
In graph theory, the Lovász conjecture (1969) is a classical problem on Hamiltonian paths in graphs.
View the Source

Take a Related Quiz

Comments (0)
No comments yet. Be the first to share a thought.
Reader Challenges (0)
No disputes yet. Spotted an error or a better source? Open the first one.