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
László Lovász
Filter Results2 entries
Connections
Attributed Works
Source Wolfram MathWorld: Kneser Graph
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)
Source Wolfram MathWorld: Perfect Graph Theorem - Wolfram MathWorld
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
LeadQuote, 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.
Wolfram MathWorld: Perfect Graph Theorem - Wolfram MathWorld
Wolfram MathWorldProofs Credited: Perfect Graph Theorem, Page textQuote, Proofs Credited: Perfect Graph Theorem, Page text
proved by Lovász (1972) and thenceforth became known as the perfect graph
Wolfram MathWorld: Kneser Graph
Wolfram MathWorldAttributed Works: Kneser Graph, Lead paragraphQuote, Attributed Works: Kneser Graph, Lead paragraph
The Kneser graphs are a class of graph introduced by Lovász (1978) to prove Kneser's conjecture
Lovász Number (Wikipedia)
Attributed Works: Lovász Number, Lead sentence, attributionQuote, Attributed Works: Lovász Number, Lead sentence, attribution
first introduced by László Lovász
Lovasz local lemma (Wikipedia)
Proofs Credited: Lovasz Local Lemma, LeadQuote, 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.
Lovász conjecture (Wikipedia)
Conjectures Posed: Lovasz Conjecture, LeadQuote, Conjectures Posed: Lovasz Conjecture, Lead
In graph theory, the Lovász conjecture (1969) is a classical problem on Hamiltonian paths in graphs.
Reader Challenges (0)
No disputes yet. Spotted an error or a better source? Open the first one.
Sign in to dispute this or suggest a correction.